Optimal-route computation is an important function that is needed in many applications, especially in transportation-related activities. In certain applications, the real-time processing of this computation is required. The conventional algorithms for computing optimal routes do not handle this real-time requirement very efficiently, especially when large networks are involved. Therefore, alternative algorithms are needed. Of the possible alternatives, heuristic algorithms are considered to treat the real-time constraint much more effectively than nonheuristic algorithms. This paper discusses a heuristic algorithm for real-time computation of routes and compares it with other techniques and approaches.
REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH
Journal of Intelligent Transportation Systems ; 3 , 2 ; 111-127
1996-01-01
17 pages
Article (Journal)
Electronic Resource
English
REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH
Taylor & Francis Verlag | 1996
An Interactive Web-Based Public Transport Enquiry System With Real-Time Optimal Route Computation
Online Contents | 2012
|Time-constrained heuristic search for practical route finding
Tema Archive | 1999
|