Skip to main content
SpringerLink
Log in

Transit Network Design Problem: An Expansion of the Route Generation Algorithm

  • Conference paper
  • First Online:
Advanced Concepts, Methodologies and Technologies for Transportation and Logistics (EURO 2016, EWGT 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 572))

  • 1643 Accesses

Abstract

The problem of public transportation routes network design deals with establishing the configuration of transit routes in a transportation network. This problem is recognized as one of the most complicated problems in transportation planning. An appropriate design of transit network will help increasing transit share of urban trips and reducing traffic congestion in urban networks. Previous research proposed the Route Generation Algorithm (RGA) in which shortest paths with the highest demands are selected and then expanded by insertion of new nodes in order to increase transit demand coverage. This paper extends RGA by introducing a new algorithm namely Extended Route Generation Algorithm (ERGA) with further details in node insertion scheme. A heuristic algorithm is proposed, tested in a medium-size network, and applied on a real-size network. In contrast to the conventional RGA in which all nodes are examined to be inserted between nodes of Origin-Destination (O-D) pairs, the algorithm inserts only adjacent nodes to the shortest paths between selected (O-D) pairs. Moreover, the proposed algorithm restricts the distance between each pair of nodes, not to be greater than two times of the shortest path length between the two nodes and the travel time of each generated route in the problem. Also, the number of common links between proposed routes of ERGA has been restricted due to the specifications of case study network.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

References

  1. Baaj, M.H., Mahmassani, H.S.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187–209 (1991)

    Article  Google Scholar 

  2. Baaj, M.H., Mahmassani, H.S.: Hybrid route generation heuristic algorithm for the design of transit networks. Transp. Res. Part C Emerg. Technol. 3(1), 31–50 (1995)

    Article  Google Scholar 

  3. Bagloee, S.A., Ceder, A.A.: Transit-network design methodology for actual-size road networks. Transp. Res. Part B Methodol. 45(10), 1787–1804 (2011)

    Article  Google Scholar 

  4. Bar-Gera, H.: Transportation network test problems. http://www.bgu.ac.il/~bargera/tntp. Accessed 20 Sep 2011

  5. Barra, A., et al.: Solving the transit network design problem with constraint programming. In: 11th World Conference in Transport Research-WCTR 2007 (2007)

    Google Scholar 

  6. Ceder, A., Israeli, Y.: Creation of objective functions for transit network design (1997)

    Google Scholar 

  7. Chakroborty, P., Wivedi, T.: Optimal route network design for transit systems using genetic algorithms. Eng. Optim. 34(1), 83–100 (2002)

    Article  Google Scholar 

  8. Fan, W., Machemehl, R.B.: Optimal transit route network design problem with variable transit demand: genetic algorithm approach. J. Transp. Eng. 132(1), 40–51 (2006)

    Article  Google Scholar 

  9. Fan, W., Machemehl, R.B.: Using a simulated annealing algorithm to solve the transit route network design problem. J. Transp. Eng. 132(2), 122–132 (2006)

    Article  Google Scholar 

  10. Fan, L., Mumford, C.L.: A metaheuristic approach to the urban transit routing problem. J. Heuristics 16(3), 353–372 (2010)

    Article  MATH  Google Scholar 

  11. Farahani, R.Z., et al.: A review of urban transportation network design problems. Eur. J. Oper. Res. 229(2), 281–302 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Guan, J., Yang, H., Wirasinghe, S.: Simultaneous optimization of transit line configuration and passenger line assignment. Transp. Res. Part B Methodol. 40(10), 885–902 (2006)

    Article  Google Scholar 

  13. Hu, J., Shi, X., Song, J., Xu, Y.: Optimal design for urban mass transit network based on evolutionary algorithms. In: Wang, L., Chen, K., Ong, Y.S. (eds.) ICNC 2005. LNCS, vol. 3611, pp. 1089–1100. Springer, Heidelberg (2005). doi:10.1007/11539117_148

    Chapter  Google Scholar 

  14. Johar, A., Jain, S., Garg, P.: Transit network design and scheduling using genetic algorithm–a review. Int. J. Optim. Control Theor. Appl. (IJOCTA) 6(1), 9–22 (2016)

    Article  MathSciNet  Google Scholar 

  15. Kepaptsoglou, K., Karlaftis, M.: Transit route network design problem: review. J. Transp. Eng. 135(8), 491–505 (2009)

    Article  Google Scholar 

  16. Lee, Y.-J., Vuchic, V.R.: Transit network design with variable demand. J. Transp. Eng. 131(1), 1–10 (2005)

    Article  Google Scholar 

  17. Mandl, C.E.: Evaluation and optimization of urban public transportation networks. Eur. J. Oper. Res. 5(6), 396–404 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  18. Mauttone, A., Urquhart, M.E.: A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 36(8), 2440–2449 (2009)

    Article  MATH  Google Scholar 

  19. Ngamchai, S., Lovell, D.J.: Optimal time transfer in bus transit route network design using a genetic algorithm. J. Transp. Eng. 129(5), 510–521 (2003)

    Article  Google Scholar 

  20. Nikolić, M., Teodorović, D.: A simultaneous transit network design and frequency setting: computing with bees. Expert Syst. Appl. 41(16), 7200–7209 (2014)

    Article  Google Scholar 

  21. Pattnaik, S., Mohan, S., Tom, V.: Urban bus transit route network design using genetic algorithm. J. Transp. Eng. 124(4), 368–375 (1998)

    Article  Google Scholar 

  22. Poorzahedy, H., Safari, F.: An ant system application to the bus network design problem: an algorithm and a case study. Pub. Transp. 3(2), 165–187 (2011)

    Article  Google Scholar 

  23. Seyedabrishami, S., Nazemi, M., Shafiei, M.: Off-line calibration of a macroscopic dynamic traffic assignment model: iterative demand-supply parameters estimation. In: 17th International IEEE Conference on Intelligent Transportation Systems (ITSC). IEEE (2014)

    Google Scholar 

  24. Shafiei, M., Nazemi, M., Seyedabrishami, S.: Estimating time-dependent origin–destination demand from traffic counts: extended gradient method. Transp. Lett. 7(4), 210–218 (2015)

    Article  Google Scholar 

  25. Tom, V., Mohan, S.: Transit route network design using frequency coded genetic algorithm. J. Transp. Eng. 129(2), 186–195 (2003)

    Article  Google Scholar 

  26. Yang, Z., Yu, B., Cheng, C.: A parallel ant colony algorithm for bus network optimization. Comput. Aided Civ. Infrastruct. Eng. 22(1), 44–55 (2007)

    Article  Google Scholar 

  27. Zarrinmehr, A., Saffarzadeh, M., Seyedabrishami, S.: A local search algorithm for finding optimal transit routes configuration with elastic demand. Int. T. Oper. Res. (2016). doi:10.1111/itor.12359

  28. Zarrinmehr, A., Saffarzadeh, M., Seyedabrishami, S., Nie, Y.M.: A path-based greedy algorithm for multi-objective transit routes design with elastic demand. Public Transp. 8(2), 261–293 (2016)

    Article  Google Scholar 

  29. Zhao, F., Zeng, X.: Optimization of user and operator cost for large-scale transit network. J. Transp. Eng. 133(4), 240–251 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

The contents of this paper reflect the views of the authors, who are responsible for the facts and the accuracy of the data presented herein. The authors gratefully acknowledge the contributions of Aavand Consulting Engineers Company for generously providing data and reports of the comprehensive transportation studies of Ardebil city.

Author information

Authors and Affiliations

  1. Civil and Environmental Engineering Department, Tarbiat Modares University, Tehran, Iran

    Iran Khanzad, Seyedehsan Seyedabrishami, Mohsen Nazemi & Amirali Zarrinmehr

Authors
  1. Iran Khanzad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyedehsan Seyedabrishami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohsen Nazemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amirali Zarrinmehr
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyedehsan Seyedabrishami .

Editor information

Editors and Affiliations

  1. Faculty of Engineering Management, Poznań University of Technology, Poznań, Poland

    Jacek Żak

  2. Department of Management, Head of Supply Chain Management and Logistics Studies; Faculty of Social Sciences, Bar-Ilan University, Ramat Gan, Israel

    Yuval Hadas

  3. Department of Civil, Environmental and Architectural Engineering, University of Padova, Padova, Italy

    Riccardo Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Khanzad, I., Seyedabrishami, S., Nazemi, M., Zarrinmehr, A. (2018). Transit Network Design Problem: An Expansion of the Route Generation Algorithm. In: Żak, J., Hadas, Y., Rossi, R. (eds) Advanced Concepts, Methodologies and Technologies for Transportation and Logistics. EURO EWGT 2016 2016. Advances in Intelligent Systems and Computing, vol 572. Springer, Cham. https://doi.org/10.1007/978-3-319-57105-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57105-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57104-1

  • Online ISBN: 978-3-319-57105-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation