Abstract
The determination of efficient routes and schedules in public transport systems is complex due to the vast search space and multiple constraints involved. In this paper we focus on the Urban Transit Routing Problem concerned with the physical network design of public transport systems. Historically, route planners have used their local knowledge coupled with simple guidelines to produce network designs. Several major studies have identified the need for automated tools to aid in the design and evaluation of public transport networks. We propose a new construction heuristic used to seed a multi-objective evolutionary algorithm. Several problem specific mutation operators are then combined with an NSGAII framework leading to improvements upon previously published results.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ceder, A., Wilson, N.H.M.: Bus network design. Transportation Research Part B 20(4), 331–344 (1986)
Magnanti, T.L., Wong, R.T.: Network design and transportation planning: Models and algorithms. Transportation Science 18(1), 1–55 (1984)
Mumford, C.L.: New heuristic and evolutionary operators for the multi-objective urban transit routing problem. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 939–946 (2013)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Nielsen, G., Nelson, J.D., Mulley, C., Tegner, G., Lind, G., Lange, T.: Public transport–planning the networks. HiTrans Best Practice Guide (2005)
Zhao, F., Gan, A.: Optimization of transit network to minimize transfers (2003)
Bagloee, S.A., Ceder, A.A.: Transit-network design methodology for actual-size road networks. Transportation Research Part B 45(10), 1787–1804 (2011)
Lampkin, W., Saalmans, P.D.: The design of routes, service frequencies, and schedules for a municipal bus undertaking: A case study. In: OR, pp. 375–397 (1967)
Silman, L.A., Barzily, Z., Passy, U.: Planning the route system for urban buses. Computers & Operations Research 1(2), 201–211 (1974)
Mandl, C.E.: Applied network optimization. Academic Pr. (1979)
Mandl, C.E.: Evaluation and optimization of urban public transportation networks. European Journal of Operational Research 5(6), 396–404 (1980)
Baaj, M.H., Mahmassani, H.S.: Hybrid route generation heuristic algorithm for the design of transit networks. Transportation Research Part C 3(1), 31–50 (1995)
Agrawal, J., Mathew, T.V.: Transit route network design using parallel genetic algorithm. Journal of Computing in Civil Engineering 18(3), 248–256 (2004)
Chakroborty, P., Dwivedi, T.: Optimal route network design for transit systems using genetic algorithms. Engineering Optimization 34(1), 83–100 (2002)
Pattnaik, S.B., Mohan, S., Tom, V.M.: Urban bus transit route network design using genetic algorithm. Journal of Transportation Engineering 124(4), 368–375 (1998)
Tom, V.M., Mohan, S.: Transit route network design using frequency coded genetic algorithm. Journal of Transportation Engineering 129(2), 186–195 (2003)
Fan, W., Machemehl, R.B.: A tabu search based heuristic method for the transit route network design problem. Computer-aided Systems in Public Transport, 387–408 (2008)
Fan, W., Machemehl, R.B.: Using a simulated annealing algorithm to solve the transit route network design problem. Journal of Transportation Engineering 132(2), 122–132 (2006)
Fan, W., Machemehl, R.B.: Optimal transit route network design problem with variable transit demand: genetic algorithm approach. Journal of Transportation Engineering 132(1), 40–51 (2006)
Fan, L., Mumford, C.L., Evans, D.: A simple multi-objective optimization algorithm for the urban transit routing problem. In: IEEE Congress on Evolutionary Computation, CEC 2009, pp. 1–7 (2009)
Shih, M.C., Mahmassani, H.S.: A design methodology for bus transit networks with coordinated operations. Technical Report SWUTC/94/60016-1 (1994)
Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science 17(11), 712–716 (1971)
Croes, G.A.: A method for solving traveling-salesman problems. Operations Research 6(6), 791–812 (1958)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
John, M.P., Mumford, C.L., Lewis, R. (2014). An Improved Multi-objective Algorithm for the Urban Transit Routing Problem. In: Blum, C., Ochoa, G. (eds) Evolutionary Computation in Combinatorial Optimisation. EvoCOP 2014. Lecture Notes in Computer Science, vol 8600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44320-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-44320-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44319-4
Online ISBN: 978-3-662-44320-0
eBook Packages: Computer ScienceComputer Science (R0)