A Novel Shortest Path Method Based on Heuristic Algorithm

Abstract

Classic Dijdstra algorithm and heuristic strategy were discussed. A dynamic direction restricted searching algorithm is presented, based on the Dijkstra algorithm for computing shortest path from one node to another node in road net. In comparison with classic Dijdstra algorithm, the searching algorithm, combined with human searching thought and flexible handle, could change restricted area dynamically and save computation time. The efficiency of computing shortest path was improved by this algorithm only and better effects were given when this algorithm was combined with other algorithms. The results of comparative experiments show that the dynamic direction restricted searching algorithm led to almost a saving ratio of 50 %, in terms of both number of nodes selected and computation times.