Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
Lists
Only you see this
Abstract
We describe and analyze empirically an implementation of some generalizations of Dijkstra’s algorithm for shortest paths in graphs. The implementation formed a part of the TRANSIMS project at the Los Alamos National Laboratory. Besides offering the first implementation of the shortest path algorithm with regular language constraints, our code also solves problems with time-dependent edge delays in a quite general first-in-first-out model.
BibTeX
@inproceedings{barrett2002classical,
author = {Christopher L. Barrett and Keith R. Bisset and Riko Jacob and Goran Konjevod and Madhav V. Marathe},
title = {{Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router}},
booktitle = {ESA},
year = {2002},
doi = {10.1007/3-540-45749-6\_15},
}Loading related content...