An Optimum Vehicular Path Solution with Multi-heuristics

Heuristics have been widely used in artificial intelligence related fields including path finding. In this paper, the author argue that different heuristics can be integrated to solve the path finding problems and set forward a solution integrating greedy heuristic, directional heuristic and hierarchical heuristic. In greedy heuristic, an improved Dijkstra's algorithm based on quad heap is set forward. Then an MBR for ellipse is presented to limit the searching extent. Thirdly, hierarchical spatial reasoning is used to build another heuristic considering the hierarchical structure of road network, which makes the optimum path selection completed in higher hierarchies as much as possible. A case study is carried out with a real road network to verify the efficiency and validation of the solution integrating the above algorithms.