skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A computational study of routing algorithms for realistic transportation networks

Abstract

The authors carry out an experimental analysis of a number of shortest path (routing) algorithms investigated in the context of the TRANSIMS (Transportation Analysis and Simulation System) project. The main focus of the paper is to study how various heuristic and exact solutions, associated data structures affected the computational performance of the software developed especially for realistic transportation networks. For this purpose the authors have used Dallas Fort-Worth road network with very high degree of resolution. The following general results are obtained: (1) they discuss and experimentally analyze various one-one shortest path algorithms, which include classical exact algorithms studied in the literature as well as heuristic solutions that are designed to take into account the geometric structure of the input instances; (2) they describe a number of extensions to the basic shortest path algorithm. These extensions were primarily motivated by practical problems arising in TRANSIMS and ITS (Intelligent Transportation Systems) related technologies. Extensions discussed include--(i) time dependent networks, (ii) multi-modal networks, (iii) networks with public transportation and associated schedules. Computational results are provided to empirically compare the efficiency of various algorithms. The studies indicate that a modified Dijkstra`s algorithm is computationally fast and an excellent candidate for use in variousmore » transportation planning applications as well as ITS related technologies.« less

Authors:
; ;
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
Department of Defense, Washington, DC (United States)
OSTI Identifier:
296788
Report Number(s):
LA-UR-98-2249; CONF-980855-
ON: DE99001071; TRN: AHC29903%%186
DOE Contract Number:  
W-7405-ENG-36
Resource Type:
Conference
Resource Relation:
Conference: 2. workshop on algorithmic engineering, Saarbruecken (Germany), 19-21 Aug 1998; Other Information: PBD: [1998]
Country of Publication:
United States
Language:
English
Subject:
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION; 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ALGORITHMS; ROUTING; T CODES; URBAN AREAS; ROAD TRANSPORT; PLANNING; PERFORMANCE

Citation Formats

Jacob, R, Marathe, M V, and Nagel, K. A computational study of routing algorithms for realistic transportation networks. United States: N. p., 1998. Web.
Jacob, R, Marathe, M V, & Nagel, K. A computational study of routing algorithms for realistic transportation networks. United States.
Jacob, R, Marathe, M V, and Nagel, K. 1998. "A computational study of routing algorithms for realistic transportation networks". United States. https://www.osti.gov/servlets/purl/296788.
@article{osti_296788,
title = {A computational study of routing algorithms for realistic transportation networks},
author = {Jacob, R and Marathe, M V and Nagel, K},
abstractNote = {The authors carry out an experimental analysis of a number of shortest path (routing) algorithms investigated in the context of the TRANSIMS (Transportation Analysis and Simulation System) project. The main focus of the paper is to study how various heuristic and exact solutions, associated data structures affected the computational performance of the software developed especially for realistic transportation networks. For this purpose the authors have used Dallas Fort-Worth road network with very high degree of resolution. The following general results are obtained: (1) they discuss and experimentally analyze various one-one shortest path algorithms, which include classical exact algorithms studied in the literature as well as heuristic solutions that are designed to take into account the geometric structure of the input instances; (2) they describe a number of extensions to the basic shortest path algorithm. These extensions were primarily motivated by practical problems arising in TRANSIMS and ITS (Intelligent Transportation Systems) related technologies. Extensions discussed include--(i) time dependent networks, (ii) multi-modal networks, (iii) networks with public transportation and associated schedules. Computational results are provided to empirically compare the efficiency of various algorithms. The studies indicate that a modified Dijkstra`s algorithm is computationally fast and an excellent candidate for use in various transportation planning applications as well as ITS related technologies.},
doi = {},
url = {https://www.osti.gov/biblio/296788}, journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Dec 01 00:00:00 EST 1998},
month = {Tue Dec 01 00:00:00 EST 1998}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: