| Article ID: | iaor20001052 |
| Country: | Belgium |
| Volume: | 38 |
| Issue: | 1 |
| Start Page Number: | 43 |
| End Page Number: | 57 |
| Publication Date: | Jan 1998 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Sartenaer A. |
| Keywords: | transportation: road, urban affairs |
This paper presents an application of the so-called ‘auction algorithm’ by Bertsekas (for finding shortest paths in a directed graph) to the search of optimal routes in an urban network. A comparison of this algorithm with Dijkstra's algorithm is performed which shows that Dijkstra's algorithm is particularly well adapted to urban networks.