Comparison of Two Algorithms for the Search of Shortest Routes in Urban Networks


This paper presents an application of the so-called \auction algorithm" by Bertsekas (for nding 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. Abstract This… (More)