Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
566 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 6, DECEMBER 2002 A Genetic Algorithm for Shortest Path Routing
 

Summary: 566 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 6, DECEMBER 2002
A Genetic Algorithm for Shortest Path Routing
Problem and the Sizing of Populations
Chang Wook Ahn, Student Member, IEEE, and R. S. Ramakrishna, Senior Member, IEEE
Abstract--This paper presents a genetic algorithmic approach
to the shortest path (SP) routing problem. Variable-length chro-
mosomes (strings) and their genes (parameters) have been used for
encoding the problem. The crossover operation exchanges partial
chromosomes (partial routes) at positionally independent crossing
sites and the mutation operation maintains the genetic diversity of
the population. The proposed algorithm can cure all the infeasible
chromosomes with a simple repair function. Crossover and muta-
tion together provide a search capability that results in improved
quality of solution and enhanced rate of convergence. This paper
also develops a population-sizing equation that facilitates a solu-
tion with desired quality. It is based on the gambler's ruin model;
the equation has been further enhanced and generalized, however.
The equation relates the size of the population, the quality of so-
lution, the cardinality of the alphabet, and other parameters of
the proposed algorithm. Computer simulations show that the pro-

  

Source: Ahn, Chang Wook - School of Information and Communication Engineering, Sungkyunkwan University

 

Collections: Computer Technologies and Information Sciences