Affiliation:
1. Univ. of Arizona, Tucson
Abstract
In some highway engineering work it is necessary to find a route between two points in a city's street and freeway network such that a function of time and distance is minimized. Such a route is called a “best” route, and finding such a route is not a difficult task. The Moore Algorithm
1
accomplishes this quite nicely, and using that algorithm and a procedure developed by Hoffman and Pavley
2
(programmed by them for the IBM 650) it is even possible to find the “
N
th best path.”
Publisher
Association for Computing Machinery (ACM)
Cited by
74 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Arc-dependent networks: theoretical insights and a computational study;Annals of Operations Research;2024-04-09
2. Turn Constrained Shortest Path;2023 IEEE 20th International Conference on Smart Communities: Improving Quality of Life using AI, Robotics and IoT (HONET);2023-12-04
3. k-Fewest Turn and Shortest Path Algorithm based on Stroke Graph;Proceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation Science;2023-11-13
4. Optimal Path Planning Through a Sequence of Waypoints;IEEE Robotics and Automation Letters;2023-03
5. On the analysis of optimization problems in arc-dependent networks;Discrete Optimization;2022-08