Public Transport

, Volume 1, Issue 4, pp 275–297 | Cite as

The bus bridging problem in metro operations: conceptual framework, models and algorithms

  • Konstantinos Kepaptsoglou
  • Matthew G. Karlaftis
Original Paper

Abstract

Metro networks provide efficient transportation services to large numbers of travelers in urban areas around the World; any unexpected operational disruption can lead to rapid degradation of the provided level of service by a city’s public transportation system. In such instances, quick and efficient substitution of services is necessary for accommodating metro passengers including the widely used practice of “bridging” metro stations using bus services. Despite its widespread application, bus bridging is largely done ad-hoc and not as part of an integrated optimization procedure. In this paper we propose a methodological framework for planning and designing an efficient bus bridging network. Furthermore, we offer a set of structured steps and optimization models and algorithms for handling bus bridging problems.

Keywords

Metro network disruption Bus bridging Conceptual framework Bus route design Decision support system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baaj MH, Mahmassani HS (1991) An AI-based approach for transit route system planning and design. J Adv Transp 25(2):187–210 CrossRefGoogle Scholar
  2. Balog JN, Boyd A, Caton JE (2003) The public transportation system security and emergency preparedness planning guide. Report DOT-VNTSC-FTA-03-01, Washington DC, USA Google Scholar
  3. Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94(3):392–404 CrossRefGoogle Scholar
  4. Boyd A, Maier P, Caton JE (1998) Critical incident management guidelines. Report FTA-MA-26-7009-98-1, Washington DC, USA Google Scholar
  5. Ceder A (2003) Designing public transport network and routes. In: Lam WHK, Bell MGH (eds) Advanced modeling for transit operations and service planning. Pergamon/Elsevier, Elmsford Google Scholar
  6. Ceder A, Wilson NHM (1986) Bus network design. Transp Res B 20B(4):331–344 CrossRefGoogle Scholar
  7. Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput-Aided Civ Infrastruct Eng 18(3):184–200 CrossRefGoogle Scholar
  8. Chakroborty P, Dwivedi T (2002) Optimal route network design for transit systems using genetic algorithms. Eng Optim 34(1):83–100 CrossRefGoogle Scholar
  9. Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, Berlin Google Scholar
  10. Evans AW, Morrison AD (1997) Incorporating accident risk and disruption in economic models of public transport. J Transp Econ Policy 31:117–146 Google Scholar
  11. Fan W, Machemehl R (2004) Optimal transit route network design problem: algorithms, implementations, and numerical results. Report SWUTC/04/167244-1, Center for Transportation Research, University of Texas at Austin, TX. Google Scholar
  12. Fan W, Machemehl R (2006a) Optimal transit route network design problem with variable transit demand: a genetic algorithm approach. J Transp Eng 132(1):40–51 CrossRefGoogle Scholar
  13. Fan W, Machemehl R (2006b) Using a simulated annealing algorithm to solve the transit route network design problem. J Transp Eng 132(2):122–132 CrossRefGoogle Scholar
  14. Gallo G, Di Miele F (2001) Dispatching buses in parking depots. Transp Sci 35:322–330 CrossRefGoogle Scholar
  15. GEA Toolbox WWW site, www.geatoolbox.com, accessed April 2004
  16. Gen M, Cheng R (1999) Genetic algorithms and engineering optimization. Interscience, New York CrossRefGoogle Scholar
  17. Goldberd DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York Google Scholar
  18. Hathaway WT, Markos SH (1991) Recommended emergency preparedness guidelines for urban, rural and specialized transit systems. Report DOT-VNTSC-UMTA-91-1, Washington DC, USA Google Scholar
  19. Heimann DI (1979) Determination of transit system dependability. In: Proceedings of the annual reliability and maintainability symposium, Washington, DC, January 23–25 Google Scholar
  20. Janarthanan N, Schneider JB (1984) Computer aided design as applied to transit system emergency contingency planning. Comput Environ Urban Syst 9(1):33–52 CrossRefGoogle Scholar
  21. Kepaptsoglou K, Karlaftis M (2009) The transit route network design problem: a review. ASCE J Transp Eng 135(8):491–505 CrossRefGoogle Scholar
  22. Kepaptsoglou K (2009) Development of optimization methods for the operation of a fixed route system under emergency conditions. PhD Dissertation submitted to the National Technical University of Athens, Greece Google Scholar
  23. Meyer MD, Belobaba P (1982) Contingency planning for response to urban transportation system disruption. J Am Plan Assoc 48(4) Google Scholar
  24. Newell GF (1979) Some issues relating to the optimal design of bus routes. Transp Sci 13(1):20–35 CrossRefGoogle Scholar
  25. Petrelli M (2004) A transit network design model for urban areas. In: Brebbia CA, Wadhwa LC (eds) Urban Transport X. WIT, Boston, pp 163–172 Google Scholar
  26. Preston J, Armstrong J, Goodman C, Weston P, Takagi R (2007) Decision support system for dynamic re-scheduling of trains under disturbance. In: Proceedings of the 11th world conference on transport research, Berkeley, CA Google Scholar
  27. Schmocker J-D, Cooper S, Adeney W (2005) Metro service delay recovery: comparison of strategies and constraints across systems, transportation research record 1930. J Transp Res Board, 30–37 Google Scholar
  28. Scott DM, Novak DC, Aultman-Hall L, Guo F (2006) Network robustness index: a new method for identifying critical links and evaluating the performance of transportation networks. J Transp Geogr 14:215–227 CrossRefGoogle Scholar
  29. Silkunas S (2006) Picking up the tab: compensation for fixed-facility disruption. Transportation research record 1955. J Transp Res Board, 62–68 Google Scholar
  30. Tom VM, Mohan M (2003) Transit route network design using frequency coded genetic algorithm. J Transp Eng 129(2):186–195 CrossRefGoogle Scholar
  31. Tsuchiya R, Sugiyama Y, Yamauchi K, Fujinami K, Arisawa R, Nakagawa T (2006) Route-choice support system for passengers in the face of unexpected disturbance of train operations, computers in railways X. In: Proceedings of the tenth international conference. WIT, Boston Google Scholar
  32. Valdes DM, Martínez-Marínez FE, Colucci-Rios B, Bartolomei-Suárez S (2006) Simulation of metro operations under disruptions: application to Tren Urbano in San Juan, Puerto Rico. In: Proceedings of the 85th transportation research board annual meeting, Washington DC, USA Google Scholar
  33. Van Nes R, Hamerslag R, Immers BH (1988) Design of public transport networks. Transportation research record 1202. J Transp Res Board, 74–83 Google Scholar
  34. Van Oudheusden DL, Ranjithan S, Singh KN (1987) The design of bus route systems—an interactive location allocation approach. Transportation 14(3):253–270 CrossRefGoogle Scholar
  35. Vuchic V (2004) Urban transit: operations, planning and economics. Wiley, Hoboken Google Scholar
  36. Winter T, Zimmerman UT (2000) Real-time dispatch of trams in storage yards. Ann Oper Res 96:287–315 CrossRefGoogle Scholar
  37. Zhao F, Gan A (2003) Optimization of transit network to minimize transfers. Report BD015-02, Florida International University, FL, USA Google Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • Konstantinos Kepaptsoglou
    • 1
  • Matthew G. Karlaftis
    • 1
  1. 1.Department of Transportation Planning and Engineering, School of Civil EngineeringNational Technical University of AthensZografou CampusGreece

Personalised recommendations