A New Shortest Path Algorithm based on Heuristic Strategy

Author

Xi, Chen ; Qi, Fei ; Li Wei

Author_Institution

Inst. of Syst. Eng., Huazhong Univ. of Sci. & Technol., Wuhan

Volume

1

fYear

0

fDate

0-0 0

Firstpage

2531

Lastpage

2536

Abstract

The paper presents a new dynamic direction restricted algorithm based on the Dijkstra algorithm, direction restricted algorithm and area restricted algorithm for computing shortest-path from one node to another node in traffic networks. This new algorithm can be combined with many other used heuristic algorithms. This new algorithm has been implemented in practice. The implementation performance of that new algorithm is compared to the Dijkstra algorithm, the A* algorithm, and so on. The results of comparison show that the new algorithm is efficient not only by itself but also by combining with other algorithms. For a network containing 5000 nodes and 10000 arcs, the dynamic direction restricted algorithm led to almost a saving ratio of 50 in terms of both number of nodes selected and computation times, compared with the Dijkstra algorithm

Keywords

graph theory; heuristic programming; road traffic; transportation; Dijkstra algorithm; area restricted algorithm; dynamic direction restricted algorithm; heuristic strategy; shortest path algorithm; traffic networks; Artificial intelligence; Computer networks; Context modeling; Heuristic algorithms; Large-scale systems; Paper technology; Shortest path problem; Supply chains; Systems engineering and theory; Telecommunication traffic; Dijkstra algorithm; heuristic strategy; shortest path; the dynamic direction restricted algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1712818

Filename

1712818