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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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



    Erschienen in:

    Erscheinungsdatum :

    30.08.2013


    Format / Umfang :

    5 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    The shortest path algorithm for urban rail transit based on spatio-temporal accessibility

    Song, Xuyang / Fang, Xiao / Liu, Guanhua et al. | SPIE | 2024


    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



    Urban rail transit

    TIBKAT | 1.2015 -

    Freier Zugriff