This paper develops an efficient heuristic for the transit network design problem, formulated as an integer programming problem. The model includes a preliminary step of route set generation, followed by an iterative procedure that simultaneously selects the best routes and corresponding headways.

    The iterative procedure is performed by an infeasible start algorithm that first assigns all candidate routes with the maximal frequency, and then iteratively eliminates routes and decreases frequencies of the less attractive ones. Routes are evaluated through a frequency-based transit assignment model that considers online information.

    The proposed model is applied to the Winnipeg transit network. The transit network found by the suggested model comprised fewer, faster and more frequent lines that serve high volume of passengers, compared to the given transit network. The running time of the algorithm is very short compared to existing methods, and its simplicity enables high level and detailed calibration.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An infeasible start heuristic for the transit route network design problem


    Contributors:

    Published in:

    Publication date :

    2020-01-01


    Size :

    21 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




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

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


    Transit Route Network Design Problem: Review

    Kepaptsoglou, Konstantinos | Online Contents | 2009


    Transit Route Network Design Problem: Review

    Kepaptsoglou, K. / Karlaftis, M. | British Library Online Contents | 2009


    Electric Transit Route Network Design Problem: Model and Application

    Iliopoulou, Christina / Tassopoulos, Ioannis / Kepaptsoglou, Konstantinos et al. | Transportation Research Record | 2019