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


Vol. 18,  No. 3, pp. 157-164, Jun.  2011
10.3745/KIPSTB.2011.18.3.157


PDF
  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
  Cite this article

[IEEE Style]

J. K. Lee, S. H. Kim, J. H. Yang, "Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm," The KIPS Transactions:PartB , 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. The KIPS Transactions:PartB , 18, 3, (2011), 157-164. DOI: 10.3745/KIPSTB.2011.18.3.157.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals