| Autor: |
N. Grier, I. Chabini |
| Rok vydání: |
2003 |
| Předmět: |
|
| Zdroj: |
Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems. |
| DOI: |
10.1109/itsc.2002.1041265 |
| Popis: |
We consider the problem of finding one to all minimum time paths for all departure times in a FIFO time dependent network with discrete arc travel times. We suggest that the problem can be viewed as a series of reoptimization of shortest path trees in static networks. This is accomplished via the concept of projection. We propose an algorithm which utilizes these projections to solve the one to all shortest path problem in a dynamic network. This algorithm is unique from an operational perspective as it only requires minimum data in advance. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
