Hybrid Algorithm for Route Design on Bus Rapid Transit Systems

Published Online:https://doi.org/10.1287/trsc.2013.0478

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Upper Saddle River, NJ).Google Scholar
  • Baaj MH, Mahmassani HS (1990) Trust: A LISP program for the analysis of transit route configurations. Transportation Res. Record 1283:125–135.Google Scholar
  • Baaj MH, Mahmassani HS (1991) An AI-based approach for transit route system planning and design. J. Adv. Transportation 25(2):187–209.CrossrefGoogle Scholar
  • Baaj MH, Mahmassani HS (1995) Hybrid route generation heuristic algorithm for the design of transit networks. Transportation Res. Part C: Emerging Technologies 3(1):31–50.CrossrefGoogle Scholar
  • Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Dell’Amico M, Maffioli F, Martello S, eds. Annotated Bibliographies in Combinatorial Optimization (Wiley, New York), 311–334.Google Scholar
  • Balcombe R, Mackett R, Paulley N, Preston J, Shires J, Titheridge H, Wardman M, White P (2004) The demand for public transport: A practical guide. TRL Report 593. Accessed March 18, 2013, http://www.demandforpublictransport.co.uk/TRL593.pdf.Google Scholar
  • Bernal A, Ramirez MA, Castro H, Walteros JL, Medaglia AL (2009) JG2A: A grid-enabled object-oriented framework for developing genetic algorithms. Crowther KG, Louis GE, eds. Proc. 2009 IEEE Systems Inform. Engrg. Design Sympos. (SIEDS), Charlottesville, VA, 67–72.CrossrefGoogle Scholar
  • Black PE (2004) Hybrid algorithm. Black PE, ed. Dictionary of Algorithms and Data Structures (U.S. National Institute of Standards and Technology). Accessed March 18, 2013, http://www.nist.gov/dads.Google Scholar
  • Borndörfer R, Grötschel M, Pfetsch ME (2007) A column-generation approach to line planning in public transport. Transportation Sci. 41(1):123–132.LinkGoogle Scholar
  • Bruno G, Gendreau M, Laporte G (2002) A heuristic for the location of a rapid transit line. Comput. Oper. Res. 29(1):1–12.CrossrefGoogle Scholar
  • Cain A, Darido G, Baltes MR, Rodriguez P, Barrios JC (2006) Applicability of Bogotá's TransMilenio BRT system to the United States FL-26-7104-01. Accessed March 13, 2013, http://www.nbrti.org.Google Scholar
  • Cámara de Comercio de Bogotá (2010) Observatorio de movilidad de Bogotá y la región 5. Accessed March 13, 2013, http://www.ccb.org.co/documentos/11497_observatorio5mov.pdf.Google Scholar
  • Cascetta E (2009) Transportation Systems Analysis: Models and Applications (Springer, New York).CrossrefGoogle Scholar
  • Caserta M, Voß S (2010) Metaheuristics: Intelligent problem solving. Maniezzo V, Stützle T, Voß S, eds. Matheuristics, Annals of Information Systems, Vol. 10 (Springer, New York), 1–38.Google Scholar
  • Ceder A, Israeli Y (1992) Scheduling considerations in designing transit routes at the network level. Desrochers M, Rousseau JM, eds. Fifth Internat. Workshop Comput.-Aided Scheduling of Public Transport (CASPT), Vol. 386 (Springer-Verlag, Berlin), 113–136.CrossrefGoogle Scholar
  • Ceder A, Wilson NHM (1986) Bus network design. Transportation Res. Part B 20(4):331–344.CrossrefGoogle Scholar
  • Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput.-Aided Civil Infrastructure Engrg. 18(3):184–200.CrossrefGoogle Scholar
  • Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies. Comput. Indust. Engrg. 36(2):343–364.CrossrefGoogle Scholar
  • Chua TA (1984) The planning of urban bus routes and frequencies: A survey. Transportation 12(2):147–172.CrossrefGoogle Scholar
  • Cipriani E, Gori S, Petrelli P (2012) Transit network design: A procedure and an application to a large urban area. Transportation Res. Part C: Emerging Technologies 20(1):3–14.CrossrefGoogle Scholar
  • citymayors.com (2013) The largest cities in the world by land area, population and density. Accessed March 13, 2013, http://www.citymayors.com/statistics/largest-cities-population-125.html.Google Scholar
  • Correa JR, Schulz AS, Stier-Moses NE (2004) Selfish routing in capacitated networks. Math. Oper. Res. 29(4):961–976.LinkGoogle Scholar
  • Danaher A, Levinson HS, Zimmerman SL (2007) Bus rapid transit practitioner’s guide. TCRP Report 118. Accessed March 18, 2013, http://onlinepubs.trb.org/onlinepubs/tcrp/tcrp_rpt_118.pdf.Google Scholar
  • Desaulniers G, Hickman MD (2007) Public transit. Barnhart C, Laporte G, eds. Transportation, Handbooks in Operations Research and Management Science, Vol. 14 (Elsevier, Philadelphia), 69–127.CrossrefGoogle Scholar
  • Fan L, Mumford CL (2010) A metaheuristic approach to the urban transit routing problem. J. Heuristics 16(3):353–372.CrossrefGoogle Scholar
  • Fan W, Machemehl RB (2006) Using a simulated annealing algorithm to solve the transit route network design problem. J. Transportation Engrg. 132(2):122–132.CrossrefGoogle Scholar
  • Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur. J. Oper. Res. 229(2):281–302.CrossrefGoogle Scholar
  • Feillet D, Gendreau M, Medaglia AL, Walteros JL (2010) A note on branch-and-cut-and-price. Oper. Res. Lett. 38(5):346–353.CrossrefGoogle Scholar
  • Frangioni A, Gendron B (2009) 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Appl. Math. 157(6):1229–1241.CrossrefGoogle Scholar
  • Ghamlouche I, Crainic TG, Gendreau M (2003) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4):655–667.LinkGoogle Scholar
  • Goldberg DE (1989) Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Boston).Google Scholar
  • Guihaire V, Hao J-K (2008) Transit network design and scheduling: A global review. Transportation Res. Part A: Policy Practice 42(10):1251–1273.CrossrefGoogle Scholar
  • Hidalgo D, Gutiérrez L (2013) BRT and BHLS around the world: Explosive growth, large positive impacts and many issues outstanding. Res. Transportation Econom. 39(1):8–13.CrossrefGoogle Scholar
  • Kepaptsoglou K, Karlaftis M (2009) Transit route network design problem: Review. J. Transportation Engrg. 135(8):491–505.CrossrefGoogle Scholar
  • Laporte G, Mesa JA, Ortega FA (2002) Locating stations on rapid transit lines. Comput. Oper. Res. 29(6):741–759.CrossrefGoogle Scholar
  • Laporte G, Marín A, Mesa JA, Ortega FA (2007) An integrated methodology for the rapid transit network design problem. Geraets F, Kroon LG, Schöbel A, Wagner D, Zaroliagis CD, eds. Algorithmic Methods for Railway Optimization, Lecture Notes Comput. Sci., Vol. 4359 (Springer-Verlag, Berlin), 187–199.CrossrefGoogle Scholar
  • Laporte G, Marín A, Mesa JA, Perea F (2011) Designing robust rapid transit networks with alternative routes. J. Adv. Transportation 45(1):54–65.CrossrefGoogle Scholar
  • Leiva C, Muñoz JC, Giesen R, Larrain H (2010) Design of limited-stop services for an urban bus corridor with capacity constraints. Transportation Res. Part B: Methodological 44(10): 1186–1201.CrossrefGoogle Scholar
  • Levinson H, Zimmerman S, Clinger J, Rutherford S, Smith RL, Cracknell J, Soberman R (2003) Bus rapid transit volume 1: Case studies in bus rapid transit. TCRP report 90. Accessed March 18, 2013, http://onlinepubs.trb.org/onlinepubs/tcrp/tcrp_rpt_90v1.pdf.Google Scholar
  • Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.LinkGoogle Scholar
  • Mandl CE (1980) Evaluation and optimization of urban public transportation networks. Eur. J. Oper. Res. 5(6):396–404.CrossrefGoogle Scholar
  • Marín A (2007) An extension to rapid transit network design problem. TOP 15(2):231–241.CrossrefGoogle Scholar
  • Marín A, Jaramillo P (2008) Urban rapid transit network design: Accelerated Benders decomposition. Ann. Oper. Res. 169(1): 35–53.CrossrefGoogle Scholar
  • McAllister E (2003) Meeting with AL Medaglia. Universidad de los Andes, Bogotá, Colombia, November 7.Google Scholar
  • McBride RD (1998) Advances in solving the multicommodity-flow problem. Interfaces 28(2):32–41.LinkGoogle Scholar
  • Medaglia AL, Gutiérrez E (2007) An object-oriented framework for rapid genetic algorithms development. Rennard J-P, ed. Handbook of Research on Nature Inspired Computing for Economics and Management (Idea Group Publishing, Hershey, PA), 608–624.CrossrefGoogle Scholar
  • Michalewicz Z (1996) Genetic Algorithms + Data Structures = Evolution Programs (Springer-Verlag, New York).CrossrefGoogle Scholar
  • Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Systems 9(3):193–212.Google Scholar
  • Moscato P (1999) Memetic algorithms: A short introduction. Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, eds. New Ideas in Optimization (McGraw-Hill, Maidenhead, UK), 219–234.Google Scholar
  • Odoni AR, Rousseau J-M, Wilson NHM (1994) Models in urban and air transportation. Pollock SM, Rothkopf MH, Barnett A, eds. Operations Research and The Public Sector, Handbooks in Operations Research and Management Science, Vol. 6 (Elsevier, Philadelphia), 107–150.CrossrefGoogle Scholar
  • Ortúzar J de D, Willumsen LG (1994) Modeling Transport (Wiley, New York).Google Scholar
  • Pattnaik SB, Mohan S, Tom VM (1998) Urban bus transit route network design using genetic algorithm. J. Transportation Engrg. 124(4):368–375.CrossrefGoogle Scholar
  • Schöbel A (2012) Line planning in public transportation: Models and methods. OR Spectrum 34(3):491–510.CrossrefGoogle Scholar
  • Silman LA, Barzily Z, Passy U (1974) Planning the route system for urban buses. Comput. Oper. Res. 1(2):201–211.CrossrefGoogle Scholar
  • Tomlin JA (1966) Minimum-cost multicommodity network flows. Oper. Res. 14(1):45–51.LinkGoogle Scholar
  • TransMilenio SA (2013) TransMilenio official website. Accessed March 18, 2013, http://www.transmilenio.gov.co.Google Scholar
  • Weinstock A, Hook W, Replogle M, Cruz R (2011) Recapturing global leadership in bus rapid transit. Report, Institute for Transportation and Development Policy, New York. Accessed March 18, 2013, http://www.itdp.org/documents/20110526ITDP_USBRT_Report-HR.pdf.Google Scholar
  • Whitley D (1995) Modeling hybrid genetic algorithms. Winter G, Périaux J, Galán M, Cuesta P, eds. Genetic Algorithms (Wiley, New York), 191–201.Google Scholar
  • Zhao F, Zeng X (2006) Simulated annealing-genetic algorithm for transit network optimization. J. Comput. Civil Engrg. 20(1): 57–68.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.