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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Urban Transit Route Network Design Problem using Tabu Search Algorithm


    Contributors:
    Lei, Deming (author) / Yan, Xinping (author)

    Conference:

    First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China



    Publication date :

    2007-07-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Urban Transit Route Network Design Problem using Tabu Search Algorithm

    Lei, D. / Yan, X. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2007



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

    Fan, Wei / Machemehl, Randy B. | Springer Verlag | 2008


    Urban Bus Transit Route Network Design Using Genetic Algorithm

    Pattnaik, S. B. / Mohan, S. / Tom, V. M. | British Library Online Contents | 1998