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

    Résultats de recherche: Contribution à un journal/une revueArticle

    69 Téléchargements (Pure)

    Résumé

    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.
    langue originaleAnglais
    Pages (de - à)43-57
    Nombre de pages15
    journalBelgian Journal of Operations Research, Statistics and Computer Science
    Volume38
    Numéro de publication1
    Etat de la publicationPublié - 1998

    Empreinte digitale

    Examiner les sujets de recherche de « Comparison of two algorithms for the search of shortest routes in urban networks ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation