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'...
Saved in:
| Published in: | 2008 IEEE International Conference on Service Operations and Logistics, and Informatics Vol. 2; pp. 1500 - 1504 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.10.2008
|
| Subjects: | |
| ISBN: | 1424420121, 9781424420124 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |

