Hierarchical efficient route planning in road networks

In this paper, a hierarchical route planning using Q value-based Dynamic Programming has been proposed. In the proposed method, a road network is divided into several subnetworks. A high-level road network is built with origin, destination and border intersections of subnetworks and the optimal traveling time between them are used to find the route from origin to destination using Q value-based Dynamic Programming. Additionally, a new re-routing method is proposed when the traveling times of sections are changed, where the border intersections in the route are kept fixed and only the route between them are re-optimized. The efficiency of the hierarchical method and accuracy of the re-routing method is evaluated using the Kitakyushu road network. The simulation results show that the hierarchical method is efficient to perform the search of a large number of routes. In addition, the results also show that the proposed re-routing method gives the route with the traveling time very near to the optimal traveling time.

[1]  Shingo Mabu,et al.  Dynamic optimal route search algorithm for car navigation systems with preferences by dynamic programming , 2011 .

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  Yangsheng Xu,et al.  A simulation study on agent-network based route guidance system , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[4]  Shingo Mabu,et al.  Optimal Route Based on Dynamic Programming for Road Networks , 2008, J. Adv. Comput. Intell. Intell. Informatics.

[5]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[8]  Thambipillai Srikanthan,et al.  Heuristic techniques for accelerating hierarchical routing on road networks , 2002, IEEE Trans. Intell. Transp. Syst..

[9]  Kotaro Hirasawa,et al.  An efficient preprocessing method for suboptimal route computation , 2011 .

[10]  Shingo Mabu,et al.  A Genetic Algorithm Based Clustering Method for Optimal Route Calculation on Multilevel Networks , 2011 .

[11]  Bing Liu,et al.  Route finding by using knowledge about the road network , 1997, IEEE Trans. Syst. Man Cybern. Part A.

[12]  Xiao Fan Wang,et al.  Efficient Routing on Large Road Networks Using Hierarchical Communities , 2011, IEEE Transactions on Intelligent Transportation Systems.

[13]  Bo Chen,et al.  A Review of the Applications of Agent Technology in Traffic and Transportation Systems , 2010, IEEE Transactions on Intelligent Transportation Systems.

[14]  Sakti Pramanik,et al.  An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..

[15]  Léon J. M. Rothkrantz,et al.  Dynamic routing using the network of car drivers , 2009, EATIS.