A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network

In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object and least transfer times as second object. And the impacts of the real-time traffic information to the roads' smooth, the passenger'...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2008 IEEE International Conference on Service Operations and Logistics, and Informatics Ročník 2; s. 1500 - 1504
Hlavní autori: Zihui Zang, Wenxue Cai
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2008
Predmet:
dynamic shortest path algorithm
GIS
Global Positioning System
Heuristic algorithms
Legged locomotion
Network topology
Real-time systems
real-time traffic information
Roads
Time-frequency analysis
Topology
transit network
Urban areas
ISBN:1424420121, 9781424420124
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, a new improved dynamic algorithm is proposed to find the optimal path in transit network, which uses the shortest travel time as primary object and least transfer times as second object. And the impacts of the real-time traffic information to the roads' smooth, the passenger's transfer times and changing price of public transportation line to the travel time are also taken into consideration in the new dynamic algorithm. A simple numerical example is given to show the new algorithm's efficiency.
ISBN:1424420121
9781424420124
DOI:10.1109/SOLI.2008.4682762