Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2011.18B.3.157

Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm  

Lee, Jung-Kyu ((주)사이람)
Kim, Seon-Ho (서강대학교 컴퓨터공학과)
Yang, Ji-Hoon (서강대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartB / v.18B, no.3, 2011 , pp. 157-164 More about this Journal
Abstract
This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.
Keywords
Shortest Path Problem; Genetic Algorithm; Dijkstra Algorithm; Routing Problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kanoh, H., "Dynamic route planning for car navigation systems using virus genetic algorithms," International Journal of Knowledge-based and Intelligent Engineering Systems, Vol.11, pp.65-78, 2007.   DOI
2 Kanoh, H., and Hara, K. ""Hybrid genetic algorithm for dynamic multiobjective route planning with predicted traffic in a real-world road network,"" in Proceedings of the 10th annual conference on on Genetic and evolutionary computation. ACM, 2008, pp.657-664.
3 Dijkstra, E. W., "A note on two problems in connexion with graphs." Numerische Mathematik 1: 269-271, 1959.   DOI
4 Cherkassky B. V., A. V. Goldberg and T. radzik, "Shortest Paths Algorithms: Theory and Experimental Evaluation",Technical report 93-1480, Computer Science Department, Stanford University, 1993.
5 Sutton, R.S., and Barto, A. G."Reinforcement Learning." MIT Press, 1997.
6 Cant-paz, E. "A survey of parallel genetic algorithm", Calculateurs Paralleles, Vol.10, pp.141-171, 1998.
7 TPEG, website, http://www.tpeg.org
8 Ahn, C. W. and Ramakrishna, R. S. 2002. "A genetic algorithm for shortest path routing problem and the sizing of populations." IEEE Trans. Evol. Comput., Vol.6, pp.566-579, Dec.
9 Goldberg, D. E. , "Genetic algorithms in Search, Optimization and Machine Learning", Addison-Wesley Longman, Inc, Boston, 1989.
10 Yi, W., Q. Liu, and Y. He, "Dynamic distributed genetic algorithm", Proceedings of the 2000 Congress on Evolution Computation, Vol.2, pp1132-1136, 2000.
11 Alba, E., "Parallel Metaheuristics : A New Class of Algorithms", JohnWiley & Sons, Inc., New Jersey, 2005.