Urban Transit Route Network Design Problem using Tabu Search Algorithm

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.