The preparation of shunting plan of the station is an essential element of rail transport organization. This issue establishes the dynamic programming model of optimal shunting plan in intermediate station according to its requirements and characteristics. Through the analysis of cars’ positions and their moving costs, a cost function about most times of moves of cars is established. Meanwhile, an approximation algorithm of potential search is designed. By the combination of the dynamic programming algorithm and potential algorithm, an implicit enumeration algorithm of intermediate station is designed, which has been applied very well in practice.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Implicit Enumeration Algorithm to Optimize the Preparation of Shunting Plan of Intermediate Station


    Contributors:
    Zheng, Wenjia (author) / Sun, Yan (author) / Sun, Liucheng (author)

    Conference:

    17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China


    Published in:

    CICTP 2017 ; 1897-1908


    Publication date :

    2018-01-18




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Development of station shunting scheduling algorithm

    Tomii, Norio / Fukumura, Naoto / Zhou, Li Jiang | IuD Bahn | 2001


    Development of Station Shunting Scheduling Algorithm

    Tomii, N. / Fukumura, N. / Zhou, L. J. | British Library Online Contents | 2001


    Railway station shunting operation electronic hook plan execution system

    LI JITAO / WU HAO | European Patent Office | 2020

    Free access

    Railway passenger station shunting plan comprehensive management method and system

    CHEN YI / LIU ZHE / ZHANG YINAN et al. | European Patent Office | 2022

    Free access

    Marshalling shunting operation plan compilation method for railway marshalling station

    SONG YU / YAO YUFENG / GAN LU et al. | European Patent Office | 2024

    Free access