DGA : A Fast and Scalable Re-routing Algorithm based on Shortest Path and Genetic Algorithms

This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm, DGA, 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. Then the genetic algorithm keeps finding the best routes with appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that DGA produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as Dijkstra’s algorithm in large-scale routing problems.

[1]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[2]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[3]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[4]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[5]  Richard S. Sutton,et al.  Dimensions of Reinforcement Learning , 1998 .

[6]  Peng Song.  QoS Routing Based on Genetic Algorithm , 2004 .

[7]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

[8]  Hitoshi Kanoh,et al.  Dynamic route planning for car navigation systems using virus genetic algorithms , 2007, Int. J. Knowl. Based Intell. Eng. Syst..

[9]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[10]  R. Bellman.  A Markovian Decision Process , 1957 .

[11]  Mekki Ksouri,et al.  Multi-Objective Optimization for the m-PDPTW: Aggregation Method With Use of Genetic Algorithm and Lower Bounds , 2011, Int. J. Comput. Commun. Control.

[12]  Michael L. Littman,et al.  Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.

[13]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[14]  Hitoshi Kanoh,et al.  Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real-world road network , 2008, GECCO '08.