Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 43-57 |
| Number of pages | 15 |
| Journal | Belgian Journal of Operations Research, Statistics and Computer Science |
| Volume | 38 |
| Issue number | 1 |
| Publication status | Published - 1998 |