This paper presents a tabu search-based solution method to the transit route network design problem. The design is of two phases. A good initial solution is produced by a route generation algorithm in the first phase. The initial solution is improved through route-merge operator, route-break operator and add-link operator in the second phase. The proposed method is applied to a benchmark network and compared with a genetic algorithm and computational results are presented.
Urban Transit Route Network Design Problem using Tabu Search Algorithm
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
2007-07-09
Conference paper
Electronic Resource
English
Urban Transit Route Network Design Problem using Tabu Search Algorithm
British Library Conference Proceedings | 2007
|A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem
Springer Verlag | 2008
|Urban Bus Transit Route Network Design Using Genetic Algorithm
British Library Online Contents | 1998
|Urban Bus Transit Route Network Design Using Genetic Algorithm
Online Contents | 1998
|