A tabu search based heuristic method for the transit route network design problem

26Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fan, W., & Machemehl, R. B. (2008). A tabu search based heuristic method for the transit route network design problem. In Lecture Notes in Economics and Mathematical Systems (Vol. 600, pp. 387–408). https://doi.org/10.1007/978-3-540-73312-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free