A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem

Wei Fan () and Randy B. Machemehl ()
Additional contact information
Wei Fan: University of Texas at Austin
Randy B. Machemehl: University of Texas at Austin

A chapter in Computer-aided Systems in Public Transport, 2008, pp 387-408 from Springer

Abstract: 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.

Keywords: Tabu Search Algorithm; Transit Route; Tabu Search Method; Tabu Search Procedure; Tabu Tenure (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (7)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-73312-6_20

Ordering information: This item can be ordered from
http://www.springer.com/9783540733126

DOI: 10.1007/978-3-540-73312-6_20

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().