Optimal Municipal Bus Routing Using a Genetic Algorithm

  • Jay M. Suiter
  • Donald H. Cooley
Conference paper


Efficient utilization of mass transit is a cost effective and environmentally sound means to meet urban transportation needs. One of the most common forms of mass transit is the municipal bus. The process of bus route assignment is extremely complex when issues such as efficiency, ridership, access, etc. are considered. This paper describes a genetic algorithmic (GA) approach for the efficient design of municipal bus routes. For complex problems, the GA-based algorithm is more efficient and flexible than manual or other computer-based processes. The genetic algorithm in this study finds an optimal or near optimal route based on the features of a given bus route service area. For this study, four features were considered: ridership, the significance of visited sites, distance, and impediments. Other attributes such as fuel efficiency, time of travel, etc. can be added to the system, and the user can change the relative importance of attributes to allow for a “what if” type of analysis.


Genetic Algorithm Optimal Route Vehicle Route Problem Short Path Algorithm Common Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bertsimas, Dimitris. “Computational Approaches to Stoehastie Vehicle Routing Problems.” Trans. Sci., 29, 342–352 (1995).CrossRefMATHGoogle Scholar
  2. [2]
    Ceder, Avishai, and Wilson, Nigel H. M., “Bus Network Design.” Trans. Res.-B, 20B, 4, 331–344 (1986).CrossRefGoogle Scholar
  3. [3]
    Duhamel, Christophe, “A Tabu Seareh Heuristic for the Vehicle Routing Problem with Baekhauls and Time Windows.” Trans. Sci., 31, 49–59 (1997).CrossRefMATHGoogle Scholar
  4. [4]
    Goldberg, David E. 1989 “Genetic Algorithms in Seareh, Optimization, and Machine Learning.” Reading, MA: Addison-Wesley Publishing.Google Scholar
  5. [5]
    Hooper, Dale C., Flann, Nicholas S., and Fuller, Stephanie R, “Recombinative Hill-Climbing: A Stronger Seareh Method for Genetic Programming.” Genetic Programming 1997: Proceedings of the Second Annual Conference, 174–179 (1997).Google Scholar
  6. [6]
    Kuo, J., “Optimal Bus Route Search Using Genetic Algorithrns.” Areport submitted in partial fulfillment of the requirements for the degree of a Master of Science in Computer Science, Utah State University. Logan, Utah. (1997).Google Scholar
  7. [7]
    Malandraki, Chryssi. “Time Dependent Vehicle Routing Problems: Forrnulations, Properties and Heuristic Algorithms.” Trans. Sci., 26 185–200 (1992).CrossRefMATHGoogle Scholar
  8. [8]
    Pattnaik, S. B.., Mohan, S., and Tom, V.M., “Urban Bus Transit Route Network Design Using Genetie Algorithm.” Trans. Eng., 124, 4, 368–375. (1998).CrossRefGoogle Scholar
  9. [9]
    Ramirez, Ana I., and Seneviratne, Prianka N., “Transit Route Design Applieations Using GIS.” Trans. Res. Ree. No. 1557, 10–14. (1996).CrossRefGoogle Scholar
  10. [10]
    van Nes R., Hamerslag, R., and Immers, B. H., “Design of Publie Transport Networks.” Trans. Res. Rec. No. 1202, 74–83. (1986).Google Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Jay M. Suiter
  • Donald H. Cooley
    • 1
  1. 1.Computer Science DepartmentUtah State UniversityLoganUSA

Personalised recommendations