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.
Best-Routing Algorithm Based on Guangzhou Metro
Third International Conference on Transportation Engineering (ICTE) ; 2011 ; Chengdu, China
ICTE 2011 ; 679-684
2011-07-13
Conference paper
Electronic Resource
English
British Library Online Contents | 1995
Betriebsführungstechnik für die Metro Guangzhou
Online Contents | 1998
Betriebsführungstechnik für die Metro Guangzhou
Tema Archive | 1998
Metro-Triebzüge für Guangzhou (China)
IuD Bahn | 1997
|Triebzüge für die Metro Guangzhou
IuD Bahn | 1997
|