Convergence analysis of canonical genetic algorithms

Authors:
G. Rudolph
Affiliations:
Dept. of Comput. Sci., Dortmund Univ.
Venue:
IEEE Transactions on Neural Networks
Year:
1994

Citing 0
Cited 21

A self-adaptive migration model genetic algorithm for data mining applications

Information Sciences: an International Journal
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing

Computers and Operations Research
A genetic algorithm approach to the spectral estimation of time series with noise and missed observations

Information Sciences: an International Journal
A population-based artificial immune system for numerical optimization

Neurocomputing
Analog circuit optimization system based on hybrid evolutionary algorithms

Integration, the VLSI Journal
Operator context scanning to support high segmentation rates for real time license plate recognition

Pattern Recognition
Parameter tuning of PBIL and CHC evolutionary algorithms applied to solve the Root Identification Problem

Applied Soft Computing
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front

Information Sciences: an International Journal
An ensemble kernel classifier with immune clonal selection algorithm for automatic discriminant of primary open-angle glaucoma

Neurocomputing
On the analysis of the simple genetic algorithm

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Ubiquity symposium: Evolutionary computation and the processes of life: opening statement

Ubiquity
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon

Fundamenta Informaticae
ε - Optimal Stopping Time for Genetic Algorithms

Fundamenta Informaticae
Analyzing stability of algorithmic systems using algebraic constructs

ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
A novel adaptive fuzzy predictive control for hybrid systems with mixed inputs

Engineering Applications of Artificial Intelligence
A Michigan-like immune-inspired framework for performing independent component analysis over Galois fields of prime order

Signal Processing
Protein secondary structure optimization using an improved artificial bee colony algorithm based on AB off-lattice model

Engineering Applications of Artificial Intelligence
Chaotic Evolution: fusion of chaotic ergodicity and evolutionary iteration for optimization

Natural Computing: an international journal
Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model

Fundamenta Informaticae
A computational intelligence optimization algorithm: Cloud drops algorithm

Integrated Computer-Aided Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the convergence properties of the canonical genetic algorithm (CGA) with mutation, crossover and proportional reproduction applied to static optimization problems. It is proved by means of homogeneous finite Markov chain analysis that a CGA will never converge to the global optimum regardless of the initialization, crossover, operator and objective function. But variants of CGA's that always maintain the best solution in the population, either before or after selection, are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA. These results are discussed with respect to the schema theorem