原文传递
A computational study of routing algorithms for realistic transportation networks
| 题名： | A computational study of routing algorithms for realistic transportation networks |
| 作者： | Nagel, K.;Marathe, M.V.;Jacob, R.; |
| 关键词： | 32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION ;99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ALGORITHMS; ROUTING; T CODES; URBAN AREAS; ROAD TRANSPORT; PLANNING; PERFORMANCE |
| 摘要： | 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. |
| 总页数： | 21p |
| 报告类型： | 科技报告 |
相关文献
- A Computational Study of Routing Algorithms for Realistic Transportation Networks
- Enabling Congestion Avoidance and Reduction in the Michigan-Ohio Transportation Network to Improve Supply Chain Efficiency: Freight ATIS. Progress Report, October 1, 2007.
- Enabling Congestion Avoidance and Reduction in the Michigan-Ohio Transportation Network to Improve Supply Chain Efficiency: Freight ATIS. Final Report, October 2010.
- HEURISTIC ALGORITHMS FOR SOLVING HAZARDOUS MATERIALS LOGISTICAL PROBLEMS.
- Reliable Routing in Transit Networks.
- Development of analytic intermodal freight networks for use within a GIS
检索历史
应用推荐
