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.
A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem
2008-01-01
22 pages
Article/Chapter (Book)
Electronic Resource
English
Urban Transit Route Network Design Problem using Tabu Search Algorithm
British Library Conference Proceedings | 2007
|A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
Online Contents | 1996
|A tabu search heuristic for the vehicle routing problem
TIBKAT | 1992
|