原文传递
Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks
| 题名： | Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks |
| 作者： | Adler-JL |
| 关键词： | Route guidance; Heuristic methods; Transportation; Networks; Algorithms; Shortest path algorithms; Transportation networks; Shortest path |
| 摘要： | For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases. |
| 总页数： | Transportation Research Record.1998. pp 48-52 (FIGS: 1 Fig. TABS: 4 Tab REFS: 27 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- IDENTIFYING MULTIPLE REASONABLE ALTERNATIVE ROUTES: EFFICIENT VECTOR LABELING APPROACH.
- IDENTIFYING MULTIPLE AND REASONABLE PATHS IN TRANSPORTATION NETWORKS: A HEURISTIC APPROACH.
- Search problems in mission planning and navigation of autonomous aircraft
- Network Modeling 2014, Volume 2. Transportation Research Record: Journal of the Transportation Research Board, No. 2467.
- Network Modeling 2014, Volume 2. Transportation Research Record: Journal of the Transportation Research Board, No. 2467
- FINDING ALTERNATIVES TO THE BEST PATH.
检索历史
应用推荐
