Abstract

Public Transit (P. T) is very important means to reduce traffic congestions, to improve urban environmental conditions and consequently affects people social lives. Planning, designing and management of P. T are the key issues for offering a competitive mode that can compete with the private transportation. These transportation planning, designing and management issues are addressed in the Transit Network Design Problem (TNDP). It deals with a complete hierarchy of decision making process. It includes strategic, tactical and operational decisions. The main body of TNDP is two stages, namely; route design stage and frequency setting. The TNDP is extensively studied in the last five decades; however the research gate is still widely open due to its many practical and modeling challenges. In this paper, a comprehensive back-ground is given to illustrate the issues and challenges related to the TNDP to help in directing the incoming researches towards the untouched areas of the problem

References

• Ceder, A. and N. H. M. Wilson, Bus network design. Transportation Research, 1986. 20B(4): p. 331–344.
• Ceder, A. , Public transport scheduling. In Handbooks in Transport – Handbook 3: Transport Systems and Traffic Control. 2001: Elsevier Ltd.
• Ceder, A. , Urban transit scheduling: framework, review, and examples. ASCE Journal of Urban Planning and Development, 2002. 128(4): p. 225–244.
• Chakroborty, P. , Genetic Algorithms for Optimal Urban Transit Network Design. Computer – Aided Civil and Infrastructure Eng. Blackwell Publishing, Malden MA 02148, USA, 2003. 18: p. 184–200.
• NCHRP Synthesis of Highway Practice 69 (1980), Bus Route and Schedule Planning Guidelines, Transportation Research Board, National Research Council, Washington, D. C.
• Shih, M. -C. and H. Mahmassani, A design methodology for bus transit networks with coordinated operation, in SWUTC/94/60016-1, Center for Transportation, Bureau of Engineering Research. 1994, the University of Texas at Austin, Austin, Texas.
• Baaj, M. H. and H. Mahmassani, Hybrid Route Generation Heuristic Algorithm for the Design of Transit Networks. Transportation Research Part C: Emerging Technologies, 1995. 3(1): p. 31-50.
• Fan, W. , Optimal Transit Route Network Design Problem: Algorithms, Implementations, and Numerical Results. 2004, Graduate School of the University of Texas at Austin.
• dell'Olio, L. , A. Ibeas, and F. R. Díaz, Assigning vehicles types to a bus transit network. TRB 2009 Annual Meeting CD-ROM, 2008.
• Garey, M. R. and D. S. Johnson, Computers and intractability: A guide to the theory of np-completeness. W. H. Freeman, 1979: p. 5-1045.
• Baaj, M. H. , The Transit Network Design Problem: An AI-Based Approach, in Department of Civil Engineering, University of Texas, Austin, Texas. 1990.
• Zhao, F. and X. Zeng, Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. European Journal of Operational Research, 2008. 186: p. 841–855.
• 13. YANG, H. , Y. IIDA, and T. SASAKI, AN ANALYSIS OF THE RELIABILITY OF AN ORIGIN-DESTINATION TRIP MATRIX ESTIMATED FROM TRAFFIC COUNTS. Transpn. Res. -B, 1991. 25(5): p. 351-363.
• YANG, H. and J. ZHOU, OPTIMAL TRAFFIC COUNTING LOCATIONS FOR ORIGIN-DESTINATION MATRIX ESTIMATION. Transpn Res. -B, 1998. 32(2): p. 109-126.
• Li, Y. and M. J. Cassidy, A generalized and efficient algorithm for estimating transit route ODs from passenger counts. Transportation Research Part B: Methodological, 2007. 41(1): p. 114-125.
• Hasselstrom, D. , Public Transportation Planning -- A Mathematical Programming Approach, Ph. D. thesis, Department of Business Administration, University of Gothenburg, Sweden. 1981.
• VanNes, R. , R. Hamerslag, and B. H. Immer, The Design of Public Transport Networks. Transportation Research Record, No. 1202, Transportation Research Board, Washington, D. C. , 1988. 74-83.
• Gan, A. and F. Zhao, Optimization of Transit Network to Minimize Transfers. Final Report, Research Office Florida Department of Transportation 605 Suwannee Street, MS 30 Tallahassee FL 32399-0450, 2003.
• Sheffi, Y. , Urban Transportation Networks Equilibrium Analysis with Mathematical Programming Methods. 1985, Inc. Englewood Cliffs, New Jersey. p. 1-20.
• Mauttonw, A. and M. Urquhart, A route set construction algorithm for the transit network design problem. Computers and Operations Research, 2009. 36(8): p. 2440-2449.
• Owais, M. and G. Moussa, A Novel Solution Methodology for Transit Route Network Design Problem. International Journal of Civil, Architectural Science and Engineering, 2014. 8(3): p. 658-665.
• Owais, M. , et al. , Simple and Effective Solution Methodology for Transit Network Design Problem. International Journal of Computer Applications, 2014. 89(14): p. 32-40.
• Owais, M. M. A. , Investigating Optimal Bus Routes Planning and Operation in Urban Areas. 2014, Assiut University, Faculty of Engineering, Civil Department.
• MM, O. , et al. , OPTIMAL CIRCULAR BUS ROUTES PLANNING FOR TRANSIT NETWORK DESIGN PROBLEM IN URBAN AREAS. Journal of Engineering Sciences, 2013. 41.
• Owais, M. , et al. , OPTIMAL FREQUENCY SETTING FOR CIRCULAR BUS ROUTES IN URBAN AREAS. Journal of Engineering Sciences, 2013. 41(5): p. 1796 - 1811.
• Chakroborty, P. , K. Deb, and R. K. Sharma, Networkwide optimal scheduling of urban transit networks using genetic algorithms. Transportation Planning and Technology, 2001. 24(3): p. 209–26.
• Dijkstra, E. W. , A Note on Two Problems in Connection with Graphs. Numeriche Mathematik, 1959. 1: p. 269-271.
• Yen, J. Y. , Finding the K Shortest Loopless Paths in a Network. Management Science, 1971. 7(11): p. 712-716.
• Laporte, G. , The Traveling Salesman Problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 1992. 59: p. 231-247.
• Dorigo, M. , M. Birattari, and T. Stutzle, Ant Colony Optimization. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006: p. 28-39.
• Miller, C. E. , A. W. Tucker, and R. A. Zemlin, Integer programming formulation of traveling salesman problems. Journal of ACM, 1960. 7: p. 326–9.
• Ceder, A. and S. Jerby, Optimal Routing Design for Shuttle Bus Service. Transportation Research Record: Journal of the Transportation Research Board, 2006: p. 14-22.
• Ceder, A. , Public Transit Planning and Operation. 2007: Elsevier Ltd.
• Lownes, N. E. and R. B. Machemehl, Exact and heuristic methods for public transit circulator design. Transportation Research Part B, 2010. 44(2): p. 309–318.
• Yu, B. , Z. Z. Yang, and B. Z. Yao, An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 2009. 196(1): p. 171–176.
• Yu, et al. , An ant colony optimization model: the period vehicle routing problem with time windows. Transportation Research Part E, 2011. 47(2): p. 166–181.
• Nikolic, M. and D. Teodorovic, Transit network design by Bee Colony Optimization. Expert Systems with Applications, 2013. 40: p. 5945–5955.
• Lampkin, W. and P. D. Saalmans, The Design of Routes, Service Frequencies and Schedules for a Municipal Bus Undertaking: A Case Study. Operation Research Ouarterly, 1967. 18: p. 375-397.
• Baaj, M. H. and H. Mahmassani, An AI-Based Approach for Transit Route System Planning and Design. Journal of Advance Transportation, 1991. 25(2): p. 187-210.
• Szeto, W. Y. and Y. Wu, A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong. European Journal of Operational Research, 2011. 209(2): p. 141-155.
• Ceder, A. and Y. Israeli, User and Operator Perspectives in Transit Network Design. Journal of the Transportation Research Board, 2007. 1623: p. 3-7.
• Constantin, I. and M. Florian, Optimizing Frequencies in a Transit Network: a Nonlinear Bi?level Programming Approach. International Transactions in Operational Research, 1995. 2(2): p. 149-164.
• Mesbah, M. , et al. , Optimization of transit priority in the transportation network using a decomposition methodology. Transportation Research Part C: Emerging Technologies, 2011. 19(2): p. 363-373.
• Gao, Z. , H. Sun, and L. Shan, A Continuous Equilibrium Network Design Model and Algorithm for Transit Systems. Transportation Research Part B: Methodological, 2004. 38(3): p. 235-250.
• Chriqui, C. and P. Robillard, Common Bus Lines. Hautes Eludes Commercials, Montréal, Québec, Canada, Transportation, 1975. 9(2): p. 115–121.
• Marguier, P. and A. Ceder, Passenger Waiting Strategies for Overlapping Bus Routes. Massachusetts Institute of Technology, Cambridge, Massachusetts, Transportation Science, 1984. 18(3): p. 207-230.
• Hadas, Y. and M. Shnaiderman, Public-transit frequency setting using minimum-cost approach with stochastic demand and travel time. Transportation Research Part B: Methodological, 2012. 46(8): p. 1068-1084.
• Guihaire, V. and J. -K. Hao, Transit network design and scheduling: A global review. Transportation Research Part A, 2008. 42: p. 1251–1273.
• Spiess, H. , On optimal route choice strategies in transit networks. Publication 285, Centre de Recherche sur les Transports, Université de Montréal, 1983.
• Cea, J. D. and E. Fernandez, Transit assignment for congested public transport system: An equilibrium model. Transportation Science, 1993. 27(133–147).
• Zhao, F. , Large-scale transit network optimization by minimizing transfers and user cost. Journal of Public Transportation, 2006. 9(2): p. 107–129.