One feature of marshalling station's layout problem the essay analyzed is typical a bi-level programming problem. Upper layer planning means that the policymakers adopt the optimal investment strategy to achieve the optimization of wagon flow organization. Under layer planning is the optimization of wagon flow organization under the given marshalling station's layout scheme. The bi-level programming model of marshalling station's layout is constructed according to the analysis of upper and under layer planning respectively. Considering this model's complexity, genetic algorithm is applied for solving. This article also provides solving process and steps.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Layout Planning Model and Algorithm of Railway Marshalling Station


    Contributors:
    Yin, Yong (author) / Zhu, Wenting (author)

    Conference:

    Second International Conference on Transportation Engineering ; 2009 ; Southwest Jiaotong University, Chengdu, China



    Publication date :

    2009-07-29




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Layout Planning Model and Algorithm of Railway Marshalling Station

    Yin, Y. / Zhu, W. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2009


    Marshalling shunting operation plan compilation method for railway marshalling station

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

    Free access

    Railway shunting-free marshalling station system

    PAN GONGZHANG / PAN ZHENHUA / CHEN HUI et al. | European Patent Office | 2015

    Free access

    Carriage speed reducer for railway marshalling station

    LIU NINA | European Patent Office | 2020

    Free access

    Railway marshalling station traffic flow calculation method

    SONG YU / YAO YUFENG / LIU QING et al. | European Patent Office | 2024

    Free access