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.
|Pages (de - à)||43-57|
|Nombre de pages||15|
|journal||Belgian Journal of Operations Research, Statistics and Computer Science|
|Numéro de publication||1|
|Etat de la publication||Publié - 1998|