Abstract Synchronizing bus arrival and departure times at transfer stations could reduce excess transfer times. This paper addresses the planning level of bus schedule coordination problem through small timetable modifications to given an initial timetable. Timetable modifications consist of shifts in initial departure times of vehicles from the depot. Headway-sensitive passenger demand is also considered in this problem. A nonlinear mixed integer-programming model is proposed for the problem to maximize the number of total transferring passengers with smalll excess transfer times. Based on the analysis of the proposed model, a genetic algorithm combining local search (GACLS) is designed to solve this model. Several numerical experiments are performed to show the utility and performance of GACLS. For small case, the proposed GACLS is highly effective, and can obtain the optimal solution with less time than enumeration method. For large real case, the GACLS also has good performances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Combining Local Search into Genetic Algorithm for Bus Schedule Coordination through Small Timetable Modifications


    Contributors:
    Wu, Yinghui (author)


    Publication date :

    2018-09-26


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Hybrid Genetic and Taboo Search Algorithm for Solving the Bus Timetable Problem

    Ren, C. / Lu, W. / Zhao, L. et al. | British Library Conference Proceedings | 2009




    Optimization of Subway Departure Timetable by Genetic Algorithm

    He, Junxiang / Zeng, Xiaoqing / Ying, Peiran et al. | TIBKAT | 2019


    Optimization of Subway Departure Timetable by Genetic Algorithm

    He, Junxiang / Zeng, Xiaoqing / Ying, Peiran et al. | Springer Verlag | 2019