Intelligent Search Strategies for Finding Minimum Paths in Transportation Networks
TC15.5
Intelligent Search Strategies for Finding Minimum Paths in Transportation Networks Jeffrey L. Adler --- RPI, Civil Eng., JEC 4022, Troy, NY 12180-3590,
Heuristic search algorithms make use of globally available information to reduce the average running time needed to find minimum paths through networks. This paper discusses the application of heuristic search to transportation networks and illustrates ways in which global information may be used to improve the search process.
