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

Annick Sartenaer

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

Résultats de recherche: Contribution à un journal/une revue › Article

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

Accès au document

33120manuscrit soumis, 197 KB

Contient cette citation

@article{625e7335a16743df90eb6eecf0d538f9,

title = "Comparison of two algorithms for the search of shortest routes in urban networks",

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.",

author = "Annick Sartenaer",

year = "1998",

language = "English",

volume = "38",

pages = "43--57",

journal = "Belgian Journal of Operations Research, Statistics and Computer Science",

number = "1",

}

TY - JOUR

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

AU - Sartenaer, Annick

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

M3 - Article

VL - 38

SP - 43

EP - 57

JO - Belgian Journal of Operations Research, Statistics and Computer Science

JF - Belgian Journal of Operations Research, Statistics and Computer Science

IS - 1

ER -

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

Résumé

Accès au document

Empreinte digitale

Contient cette citation