Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 7, NO. 4, AUGUST 2003 367 Elitism-Based Compact Genetic Algorithms
 

Summary: IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 7, NO. 4, AUGUST 2003 367
Elitism-Based Compact Genetic Algorithms
Chang Wook Ahn, Student Member, IEEE, and R. S. Ramakrishna, Senior Member, IEEE
Abstract--This paper describes two elitism-based compact
genetic algorithms (cGAs)--persistent elitist compact genetic algo-
rithm (pe-cGA), and nonpersistent elitist compact genetic algorithm
(ne-cGA). The aim is to design efficient compact-type GAs by
treating them as estimation of distribution algorithms (EDAs) for
solving difficult optimization problems without compromising
on memory and computation costs. The idea is to deal with
issues connected with lack of memory--inherent disadvantage of
cGAs--by allowing a selection pressure that is high enough to
offset the disruptive effect of uniform crossover. The point is to
properly reconcile the cGA with elitism. The pe-cGA finds a near
optimal solution (i.e., a winner) that is maintained as long as other
solutions (i.e., competitors) generated from probability vectors
are no better. It attempts to adaptively alter the selection pressure
according to the degree of problem difficulty by employing only
the pair-wise tournament selection strategy. Moreover, it incorpo-
rates the equivalent model of the (1 + 1) evolution strategy (ES)

  

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

 

Collections: Computer Technologies and Information Sciences