The real-time train scheduling problem for urban rail transit systems is considered with the aim of minimizing the total travel time of passengers and the energy consumption of trains. Based on the passenger demand in urban rail transit systems, the optimal departure times, running times, and dwell times are obtained by solving the scheduling problem. Three solution approaches are proposed to solve the real-time scheduling problem for trains: a pattern search method, a mixed integer nonlinear programming (MINLP) approach, and a mixed integer linear programming (MILP) approach. The performance of these three approaches is compared via a case study based on the data of the Beijing Yizhuang line. The results show that the pattern search method provides a good trade-off between the control performance and the computational efficiency.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Real-time scheduling for trains in urban rail transit systems using nonlinear optimization


    Contributors:


    Publication date :

    2013-10-01


    Size :

    223923 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Real-time scheduling for single lines in urban rail transit systems

    Wang, Yihui / De Schutter, Bart / van den Boom, Ton et al. | IEEE | 2013


    Research on the Wheelset Life Optimization of Urban Rail Transit Trains

    Xu, Xiaoxiao / Ye, Zhengjun / Zhang, Jianyu et al. | TIBKAT | 2020


    Research on the Wheelset Life Optimization of Urban Rail Transit Trains

    Xu, Xiaoxiao / Ye, Zhengjun / Zhang, Jianyu et al. | Springer Verlag | 2020


    Research on the Wheelset Life Optimization of Urban Rail Transit Trains

    Xu, Xiaoxiao / Ye, Zhengjun / Zhang, Jianyu et al. | British Library Conference Proceedings | 2020


    Automatic adjustment method for urban rail transit trains based on real-time passenger flow

    HUANG QIGUANG / SHU JIANFENG / LIANG YU et al. | European Patent Office | 2020

    Free access