In recent years there has been a resurgence of interest in the minimum path problem in transportation engineering. This is directly attributed to the recent developments in Intelligent Transportation Systems (ITS), and more specially in the field of in-vehicle Route Guidance Systems (RGS). Central to any RGS is the algorithm to find the optimal mute between an origin to a estimation in a traffic network. For most RGS currently under development the optimal route between an origin and destination is defined as the one with minimum expected travel time. This optimal route is commonly calculated by applying a Dijkstra type shortest path algorithm. Many efficient algorithm have been developed and in this paper, Dijsktra's algorithm is referred to as the standard shortest path algorithms. The Detour Heuristic Algorithm is defined and finally, the trade-off between solution quality and computational efficiency of the proposed algorithm will be demonstrated. The advantage of using heuristic algorithm is it closed fewer nodes than that Dijsktra's algorithm did to find out the shortest path in the same network system.
Shortest path using detour heuristic algorithm
1999
Seiten
Conference paper
Storage medium
English
T*: a weighted double-heuristic search algorithm to find the shortest path
British Library Online Contents | 2019
|A Multiple Pairs Shortest Path Algorithm
British Library Online Contents | 2005
|A directionally oriented shortest path algorithm
Elsevier | 1968
|