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


KIPS Transactions on Computer and Communication Systems, Vol. 18, No. 3, pp. 157-164, Mar. 2011
10.3745/KIPSTB.2011.18.3.157, Full Text:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. K. Lee, S. H. Kim and J. H. Yang, "Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm," KIPS Journal B (2001 ~ 2012) , vol. 18, no. 3, pp. 157-164, 2011. DOI: 10.3745/KIPSTB.2011.18.3.157.

[ACM Style]
Jung Kyu Lee, Seon Ho Kim, and Ji Hoon Yang. 2011. Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm. KIPS Journal B (2001 ~ 2012) , 18, 3, (2011), 157-164. DOI: 10.3745/KIPSTB.2011.18.3.157.