Fuzzy-ant based dynamic routing on large road networks

Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduce the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant's behavior in nature is applied for the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic efficient route computation on large road networks.

[1]  Haris N. Koutsopoulos,et al.  A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures , 1994, Transp. Sci..

[2]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

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

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

[5]  Jeffery L. Kennington,et al.  The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm , 1993, Comput. Optim. Appl..

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

[7]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[8]  H. Salehinejad,et al.  A new ant algorithm based vehicle navigation system: A wireless networking approach , 2008, 2008 International Symposium on Telecommunications.

[9]  Sahar Idwan,et al.  Computing Breadth First Search in Large Graph Using hMetis Partitioning , 2009 .

[10]  Elke A. Rundensteiner,et al.  Effective graph clustering for path queries in digital map databases , 1996, CIKM '96.

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

[12]  Peter Sanders,et al.  Dynamic Highway-Node Routing , 2007, WEA.

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

[14]  Zhenyu Wang,et al.  An Efficient Shortest Path Computation System for Real Road Networks , 2006, IEA/AIE.

[15]  Hojjat Salehinejad,et al.  A New Route Selection System: Multiparameter Ant Algorithm Based Vehicle Navigation Approach , 2008, 2008 International Conference on Computational Intelligence for Modelling Control & Automation.

[16]  P. Varshney,et al.  Hierarchical path computation approach for large graphs , 2008, IEEE Transactions on Aerospace and Electronic Systems.