A New Genetic Algorithm for Shortest Path Routing Problem 


Vol. 27,  No. 12, pp. 1215-1227, Dec.  2002


PDF
  Abstract

This paper presents a genetic algorithmic approach to shonest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges panial chromosomes (panial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. TIle proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence.
Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. TIle results are relatively independent of problem types (network sizes and topologies) f ‘ or almost alI source-destination pairs.

  Statistics
Cumulative Counts from November, 2022
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]

A. C. Wook, R.S.Ramakrishna, K. C. Gu, "A New Genetic Algorithm for Shortest Path Routing Problem," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1215-1227, 2002. DOI: .

[ACM Style]

Ahn Chang Wook, R.S.Ramakrishna, and Kang Chung Gu. 2002. A New Genetic Algorithm for Shortest Path Routing Problem. The Journal of Korean Institute of Communications and Information Sciences, 27, 12, (2002), 1215-1227. DOI: .

[KICS Style]

Ahn Chang Wook, R.S.Ramakrishna, Kang Chung Gu, "A New Genetic Algorithm for Shortest Path Routing Problem," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1215-1227, 12. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880