Fuzzy-Ant Colony based Routing on Road Networks


  • S. Saravanan Dhirajlal Gandhi College of Technology,
  • A. Jayanthiladevi Jain University
  • M. Geetha Sona College of Technology




Hierarchical community, traffic routing, dynamic parameters, fuzzy logic, Ant- colony algorithm


Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces 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 to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the 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.


Download data is not yet available.


[1] R.V.Helgason., J. L Kennington, and B. D Stewart ., “The one-to-one shortest-path problems: An empirical analysis with the two-tree Dijkstra algorithm,” Comput. Optim. Appl., vol. 2, no. 1, pp. 47-75, Jun. 1993.
[2] L. Sun. D. Fu, and. L. R Rilett, “Heuristic shortest path algorithms for transportation applications: State of the art,” Comput. Oper. Res., vol. 33, no. 11, pp. 3324-3343, Nov. 2006.
[3] B. Liu , “Route finding by using knowledge about the road network,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 27, no. 4, pp. 436-448,Jul. 1997.
[4] G. R Jagadeesh , T. Srikanthan , and K. H Quek , “Heuristic techniques for accelerating hierarchical routing on road networks,” IEEE Trans. Intell.Transp. Syst., vol. 3, no. 4, pp. 301-309, Dec. 2002.
[5] Paper in the title of “Optimized Retransmission Mechanism to Prevent Wastage of Spectrum in Seamless Mobility Handover” Published in International Journal of Applied Engineering Research, ISSN 0973-4562 Vol. 10 No.5 (2015) pp. 3906-3910.P. Sanders and D. Schultes , “Highway hierarchies hasten exact shortest path queries,” in Proc. ESA, Mallorca, Spain, Oct. 2005, pp. 568-579.
[6] D. Schultes and P. Sanders , “Dynamic highway-node routing,” in Proc.6th Workshop Exp. Algorithms, Rome, Italy, Jun. 2007, pp. 66-79.3.
[7] Qing Song and Xiaofan Wang,”Efficient Routing on Large Road networks desired using Hierarchical communities”,IEEE transaction on intelligent transaction systems,vol.12 n0.1,March. 2011
[8] A. Jayanthiladevi & G. M. kadhar Nawaz, “An Efficient Utilization Of Spectrum In Seamless Mobility By Using Retransmission Rerouting Mechanism In Mobile IP”, Journal Of Scientific And Industrial Research, Sep-2015, NISCAIR-CSIR, India.Z. Wang ., O. Che , Chen L, and Lim A, “An efficient shortest path computation system for real road networks,” in Proc. IEA/AIE, Annecy, France,Jun. 2006, pp. 711-720.
[9] Y. Huang , N. Jing ., and E. A Rundensteiner., “Effective graph clustering for path queries in digital map database,” in Proc. CIKM, Rockville,MD, Nov. 1996, pp. 215-222.
[10] M. B Habbal , H. N Koutsopoulos , and S. R Lerman ., “A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures,” Transp. Sci., vol. 28, no. 4, pp. 292-308,Nov .1994.
[11] S. Idwan. and W. Etaiwi ., “Computing breadth first search in large graph using hMetis partitioning,” Eur. J. Sci. Res., vol. 29, no. 2, pp. 215-221,Jul. 2009.
[12] S. Jung , and S. Pramanik , “An efficient path computation model for hierarchically structured topographical road maps,” IEEE Trans. Knowl. DataEng., vol. 14, no. 5, pp. 1029-1046, Sep .2002.
[13] V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” J. Stat. Mech., vol. 2008,no. 10, p. P10 008, Oct. 2008.
[14] H. Salehinejad., F. Pouladi, and S. Talebi, “A new route selection system: multiparameter ant algorithm based vehicle navigation approach,” in Proceedings of the International Conference on Computational Intelligence for Modeling, Control and Automation, pp. 1089-1094, IEEE Computer Society,
[15] H. Salehinejad and S. Talebi, “A new ant algorithm based vehicle navigation system: a wireless networking approach,” in Proceedings of the International Symposium on Telecommunications
[16] H. Salehinejad., H. Nezamabadi-Pour, S. Saryazdi., and F. Farrahi-Moghaddam., “Combined A?-ants algorithm: a new multi-parameter vehicle navigation scheme,” in Proceedings of the 16th Iranian Conference on Electrical Engineering (ICEE ’08), pp. 154-159, Tehran, Iran. 2008.
[17] Maniezzo.V, Gambardella.L.M, and De Luigi.F, Ant Colony Optimization, New Optimization Techniques in Engineering, Springer, Berlin, Germany. 2004.




How to Cite

Saravanan, S., Jayanthiladevi, A., & Geetha, M. (2016). Fuzzy-Ant Colony based Routing on Road Networks. APTIKOM Journal on Computer Science and Information Technologies, 1(1), 33–40. https://doi.org/10.34306/csit.v1i1.42