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
01.01.1996
17 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Real-Time Optimal-Route Computation: A Heuristic Approach
British Library Online Contents | 1996
|Real-Time Optimal-Route Computation: A Heuristic Approach
British Library Online Contents | 1996
|REAL-TIME OPTIMAL-ROUTE COMPUTATION: A HEURISTIC APPROACH
Taylor & Francis Verlag | 1996
Real-Time Optimal-Route Computation: A Heuristic Approach: Response
British Library Online Contents | 1996
|An Interactive Web-Based Public Transport Enquiry System With Real-Time Optimal Route Computation
Online Contents | 2012
|