With the improvement of the first-tier city's subway network line, the transfer becomes complicated increasingly, it is necessary to provide a best travel program for subway passengers to travel between two nodes. This reference proposes the shortest routing optimization model of subway travel aiming at reducing passenger travel time as much as possible, by consulting the best path algorithm of the public transport system. In this model, the paper takes Guangzhou Metro line network as study object, taking the process of passenger travel and transfer factor into account. Adopting an improved Dijkstra algorithm, and then propose the best travel programs of the network between any two nodes.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Best-Routing Algorithm Based on Guangzhou Metro


    Contributors:
    Gao, Chang (author) / Tang, Qiaomei (author)

    Conference:

    Third International Conference on Transportation Engineering (ICTE) ; 2011 ; Chengdu, China


    Published in:

    ICTE 2011 ; 679-684


    Publication date :

    2011-07-13




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Guangzhou Metro Forges Ahead

    British Library Online Contents | 1995




    Metro-Triebzüge für Guangzhou (China)

    Riecher, Daniel | IuD Bahn | 1997


    Triebzüge für die Metro Guangzhou

    Riecher, Daniel | IuD Bahn | 1997