A SOFT COMPUTING APPROACH FOR SMOOTH TRAFFIC FLOW ON ROAD NETWORK
DOI:
https://doi.org/10.29121/granthaalayah.v5.i4.2017.1825Keywords:
Genetic Algorithm, Vehicle Routing Problem, Optimal Path PlanningAbstract [English]
Route planning has an important role in navigation systems. In order to select an optimized route the traveller has to take various factors into consideration. Traffic congestion is an important factor which needs to be considered while route planning. As the numbers of vehicles are increasing on the road the traffic congestion is also increasing in an exponential manner. In a congested area the best approach to search for a route is to select an alternative path so that we can reach our destination and indirectly save some time. In the recent years route planning system has become an important area of research since the number of vehicles are increasing day-by-day but the traffic structure is un-expandable. In this paper a genetic algorithm is proposed to develop an alternate route which results in smooth flow of traffic. Genetic Algorithm’s main aim is to create an optimized path.
Downloads
References
David Wilkie , Jur van den Berg , Ming Lin and Dinesh Manocha, “Self-Aware Traffic Route Planning”, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence,2011
B. Chakraborty, “Ga-based multiple route selection for car navigation.” in AACC, ser. Lecture Notes in Computer Science, S. Manandhar, J. Austin, U. B. Desai, Y. Oyanagi, and K. Talukder, Eds., vol. 3285. Springer, 2004, pp. 76–83.
Y. Li, R. He, and L. L. and Yaohuang Guo, “Genetic algorithms for dissimilar shortest paths based on optimal fuzzy dissimilar measure and applications.” in FSKD (1), ser. Lecture Notes in Computer Science, L. Wang and Y. Jin, Eds., vol. 3613. Springer, 2005, pp. 312–320.
H. Kanoh and T. Nakamura, “Knowledge based genetic algorithm for dynamic route selection,” International Conference on Knowledge based intelligent engineering Systems and Allied Technologies, pp. 616–619, 2000.
I.Chabini and S.Lan, “Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks,” IEEE Transactions on Intelligent Transportation Systems, vol.3, no.1, pp.60–74, 2002 DOI: https://doi.org/10.1109/6979.994796
Javed Aslam , Sejoon Lim ,Daniela Rus, “Congestion-aware Traffic Routing System Using Sensor Data”, 2012 15th International IEEE Conference on Intelligent Transportation Systems Anchorage, Alaska, USA, September 16-19, 2012 DOI: https://doi.org/10.1109/ITSC.2012.6338663
J. Inagaki, M. Haseyarna, and H. Kitajima, “A genetic algorithm for determining multiple routes and its applications,” IEEE International Symposium on Circuits and Systems, pp. 137–140, 1999
Manoranjitham A/P Muniandy, Liong Kah Mee, Lim Kok Ooi ,2014,’Efficient Route Planning for Travelling Salesman Problem , IEEE Conference on Open Systems (ICOS),October 26-28, 2014, Subang, Malaysia DOI: https://doi.org/10.1109/ICOS.2014.7042404
Manoj Kanta Mainali, Shingo Mabu and Kotaro Hirasawa,”Pruning High-level Network Using Genetic Algorithm for Efficient Hierarchical Route Planning in Road Networks”, SICE Annual Conference,2011.
W. A. Chang and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 566– 579, December 2002. Page 12 DOI: https://doi.org/10.1109/TEVC.2002.804323
Zhanke Yu, Mingfang Ni, Zeyan Wang, and Yanhua Zhang, Institute of Communication Engineering, PLA University of Science and Technology, NanJing 2, “Dynamic Route Guidance Using Improved Genetic Algorithms”, Mathematical Problems in Engineering Volume 2013, Article ID 765135, 6 pages DOI: https://doi.org/10.1155/2013/765135
Downloads
Published
How to Cite
Issue
Section
License
With the licence CC-BY, authors retain the copyright, allowing anyone to download, reuse, re-print, modify, distribute, and/or copy their contribution. The work must be properly attributed to its author.
It is not necessary to ask for further permission from the author or journal board.
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
