Thumbnail
Access Restriction
Subscribed

Author Caldwell, Tom
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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 Algorithm1 accomplishes this quite nicely, and using that algorithm and a procedure developed by Hoffman and Pavley2 (programmed by them for the IBM 650) it is even possible to find the “Nth best path.”
Description Affiliation: Univ. of Arizona, Tucson (Caldwell, Tom)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 4
Issue Number 2
Page Count 2
Starting Page 107
Ending Page 108


Open content in new tab

   Open content in new tab
Source: ACM Digital Library