Abstract
Systematic tabu search based meta-heuristic algorithms are designed and implemented for the transit route network design problem. A multi-objective nonlinear mixed integer model is formulated. Solution methodologies based on three variations of tabu search methods are proposed and tested using a small experimental network as a pilot study. Sensitivity analysis is performed, a comprehensive characteristics analysis is conducted and numerical results indicate that the preferred tabu search method outperforms the genetic algorithm used as a benchmark.
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
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs.
Baaj, M. H. and Mahmassani, H. S. (1992). Artificial intelligence-based system representation and search procedures for transit route network design. Transportation Research Record 1358, Transportation Research Board, pages 67–70.
Ceder, R. B. and Wilson, N. H. (1986). Bus network design. Transportation Research, 20B(4), 331–344.
Chien, S., Yang, Z., and Hou, E. (2001). A genetic algorithm approach for transit route planning and design. Journal of Transportation Engineering, ASCE, 127(3), 200–207.
Fan, W. and Machemehl, R. B. (2004). A Genetic Algorithm Approach for the Transit Route Network Design Problem, CSCE 2004, 5th Transportation Specialty Conference. Saskatoon.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156–166.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 5, 533–549.
Glover, F. (1989). Tabu search, part I. ORSA Journal on Computing, 1, 190–206.
Glover, F. (1990). Tabu search, part II. ORSA Journal on Computing, 2, 4–32.
Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers.
Han, A. F. and Wilson, N. (1982). The allocation of buses in heavily utilized networks with overlapping routes. Transportation Research, 16B, 221–232.
NCHRP Synthesis of Highway Practice 69 (1980). Bus route and schedule planning guidelines. Technical report, Transportation Research Board, National Research Council, Washington, D.C.
Pattnaik, S. B., Mohan, S., and Tom, V. M. (1998). Urban bus transit network design using genetic algorithm. Journal of Transportation Engineering, 124(4), 368–375.
Shih, M., Mahmassani, H. S., and Baaj, M. (1998). Trip assignment model for timedtransfer transit systems. Transportation Research Record 1571, pages 24–30.
Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11), 712–716.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, W., Machemehl, R.B. (2008). A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem. In: Hickman, M., Mirchandani, P., Voß, S. (eds) Computer-aided Systems in Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73312-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-73312-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73311-9
Online ISBN: 978-3-540-73312-6
eBook Packages: EngineeringEngineering (R0)