Skip to main content

Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

  • Conference paper
  • 1786 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 104))

Abstract

A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. APTA: 2009 Public Transportation Fact Book. American Public Transit Association, http://www.apta.com/resources/statistics/Pages/transitstats.aspx

  2. Baaj, M.H., Mahmassani, H.S.: Hybrid Route Generation Heuristic Algorithm for the Design of Transit Networks. Transportation Research Part C 3, 31–50 (1995)

    Article  Google Scholar 

  3. Ceder, A., Wilson, N.H.M.: Bus Network Design. Transportation Research Part B 20, 331–344 (1986)

    Article  Google Scholar 

  4. Chien, S., Yang, Z., Hou, E.: Genetic Algorithm Approach for Transit Route Planning and Design. J. of Transportation Engineering 127, 200–207 (2001)

    Article  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Friesz, T.L., et al.: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science 26, 18–26 (1992)

    Article  MATH  Google Scholar 

  7. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Co., Reading (1989)

    MATH  Google Scholar 

  8. Hershberger, J., Maxel, M., Suri, S.: Finding the k Shortest Simple Paths: a New Algorithm and its Implementation. ALENEX, Baltimore (2003)

    Google Scholar 

  9. Krishna Rao, K.V., Muralidhar, S., Dhingra, S.L.: Public Transport Routing and Scheduling Using Genetic Algorithms. In: Proc. 3rd Int. Workshop on Transportation Planning and Implementation Methodologies for Developing Countries, IIT Bombay, pp. 91–102 (1998)

    Google Scholar 

  10. Kuah, G.K., Perl, J.: Optimization of Feeder Bus Routes and Bus-Stop Spacing. J. of Transportation Engineering 114, 341–354 (1988)

    Article  Google Scholar 

  11. Lin, X.H., Kwok, Y.K., Lau, V.K.N.: A Genetic Algorithm Based Approach to Route Selection and Capacity Flow Assignment. Computer Communications 26, 950–960 (2003)

    Article  Google Scholar 

  12. Mandl, C.E.: Evaluation and Optimisation of Urban Public Transport Networks. European J. of Operational Research 5, 396–404 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pattnaik, S.B., Mohan, S., Tom, V.M.: Urban Bus Transit Route Network Design Using Genetic Algorithm. J. of Transportation Engineering 124, 368–375 (1998)

    Article  Google Scholar 

  14. Sadek, A.W.: Hybrid Simulated Annealing and Case-Based Reasoning Approach for Computationally Intensive Transportation Problems. Transportation Research Record 1774, 18–24 (2001)

    Article  Google Scholar 

  15. van Nes, R., Bovy, P.H.L.: The Importance of Objectives in Urban Transit Network Design. In: 79th Annual Meeting of the Transportation Research Board, Washington D.C. (2000)

    Google Scholar 

  16. VTPI: Transit Evaluation. Online TMD Encyclopedia, Victoria Transport Policy Institute, http://www.vtpi.org/tdm/tdm62.htm

  17. Zhao, F., Zeng, X.: Optimization of Transit Network Layout and Headway with a Combined Genetic Algorithm and Simulated Annealing Method. Engineering Optimization 38, 701–722 (2006)

    Article  Google Scholar 

  18. Zhao, F., Zeng, X.: Simulated Annealing-Genetic Algorithm for Transit Network Optimization. J. of Computing in Civil Engineering 20, 57–68 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, L., Olszewski, P., Goh, PC. (2010). Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design. In: Mikulski, J. (eds) Transport Systems Telematics. TST 2010. Communications in Computer and Information Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16472-9_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16472-9_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16471-2

  • Online ISBN: 978-3-642-16472-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics