Elitism-based compact genetic algorithms
- 26 August 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 7 (4), 367-385
- https://doi.org/10.1109/tevc.2003.814633
Abstract
This paper describes two elitism-based compact genetic algorithms (cGAs)-persistent elitist compact genetic algorithm (pe-cGA), and nonpersistent elitist compact genetic algorithm (ne-cGA). The aim is to design efficient cGAs 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 by allowing a selection pressure that is high enough to offset the disruptive effect of uniform crossover. The pe-cGA finds a near optimal solution (i.e., a winner) that is maintained as long as other solutions generated from probability vectors are no better. The ne-cGA further improves the performance of the pe-cGA by avoiding strong elitism that may lead to premature convergence. It also maintains genetic diversity. This paper also proposes an analytic model for investigating convergence enhancement.Keywords
This publication has 18 references indexed in Scilit:
- From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- A genetic algorithm for shortest path routing problem and the sizing of populationsIEEE Transactions on Evolutionary Computation, 2002
- Optimization based on bacterial chemotaxisIEEE Transactions on Evolutionary Computation, 2002
- A hybrid heuristic for the traveling salesman problemIEEE Transactions on Evolutionary Computation, 2001
- Self-adaptive mutations may lead to premature convergenceIEEE Transactions on Evolutionary Computation, 2001
- The compact genetic algorithmIEEE Transactions on Evolutionary Computation, 1999
- Genetic drift in genetic algorithm selection schemesIEEE Transactions on Evolutionary Computation, 1999
- Evolutionary programming made fasterIEEE Transactions on Evolutionary Computation, 1999
- The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)Evolutionary Computation, 1993
- Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter OptimizationEvolutionary Computation, 1993