This paper considers the major factors of passenger flow distribution and the running cost of train, explains and demonstrates how to sove the problem of urban rail transit resource allocation. The paper at first constructs urban rail network assignment model in the multiple operating lines based on the k-shortest paths algorithm, then proposes the k shortest paths search algorithm, finally the effectiveness of the model and algorithm are verified with the data from the Beijing urban rail transit network.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on Urban Rail Transit Resource Allocation Based on K-Shortest Paths Algorithm



    Published in:

    Publication date :

    2013-08-30


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Study on the K-Shortest Paths Searching Algorithm of Urban Mass Transit Network Based on the Network Characteristics

    Zhou, W.T. / Han, B.M. / Yin, H.D. | British Library Conference Proceedings | 2014



    Research of Urban High Rail Transit Planning

    Liu, Qian / Shen, Jingyan | ASCE | 2000



    Research of Urban Rail Transit Power Quality

    Xie, Xinhang / Ma, Xiaochun / Li, Bin et al. | Springer Verlag | 2016