Comparison of two algorithms for the search of shortest routes in urban networks

    Research output: Contribution to journalArticle

    128 Downloads (Pure)

    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 languageEnglish
    Pages (from-to)43-57
    Number of pages15
    JournalBelgian Journal of Operations Research, Statistics and Computer Science
    Volume38
    Issue number1
    Publication statusPublished - 1998

    Fingerprint Dive into the research topics of 'Comparison of two algorithms for the search of shortest routes in urban networks'. Together they form a unique fingerprint.

    Cite this