In this paper, we introduce Railroad Blocking Problem (RBP) for network. Then we propose a model formulation and an improved algorithm for RBP. The objective function of the model is to minimize the total time costs of freight trains operation, including trains running time in section, accumulation and resorting time at station. The constraints include resorting capacity of stations, carrying capacity of sections, the balance of flow, etc. To solve the model for real world railroad networks, an improved hybrid Particle Swarm optimization and Lagrange Relaxation (PSO-LR) algorithm is implemented. Finally, the computation results on a case of simplified China’s railroad network demonstrate the effectiveness and validation of the proposed method, which shows the potential application on railroad engineering industry.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Freight Railroad Network Blocking Problem: Modeling, Formulation and Improved Particle Swarm optimization Algorithm


    Contributors:
    Zhao, Hanqing (author) / Yue, Yixiang (author) / Liu, Xiang (author)


    Publication date :

    2018-12-01


    Size :

    300298 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Tabu Search Algorithm for the Railroad Blocking Problem

    Yaghini, Masoud | Online Contents | 2013


    Tabu Search Algorithm for the Railroad Blocking Problem

    Yaghini, Masoud / Ahadi, Hamid Reza / Barati, Elaheh et al. | ASCE | 2012


    Tabu Search Algorithm for the Railroad Blocking Problem

    Yaghini, M. / Ahadi, H.R. / Barati, E. et al. | British Library Online Contents | 2013


    Freight Railroad Service Network Design

    Chouman, Mervat / Crainic, Teodor Gabriel | Springer Verlag | 2020