Towards a self-stopping evolutionary algorithm using coupling from the past

Authors:
German Hernandez;Kenneth Wilder;Fernando Nino;Julian Garcia
Affiliations:
National University of Colombia, Bogota, Colombia;University of Chicago, Chicago, IL;National University of Colombia, Bogota, Colombia;National University of Colombia, Bogota, Colombia
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 5
Cited 2

Finite Markov chain results in evolutionary computation: a tour d'horizon

Fundamenta Informaticae
Iterated Random Functions

SIAM Review
How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Monte Carlo Strategies in Scientific Computing

Monte Carlo Strategies in Scientific Computing

Statistical methods for convergence detection of multi-objective evolutionary algorithms

Evolutionary Computation
An approach to stopping criteria for multi-objective optimization evolutionary algorithms: the MGBM criterion

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a stopping criterion for a particular class of evolutionary algorithms is devised. First, a model of a generic evolutionary algorithm using iterated random maps is presented. The model allows the exploration of a connection between coupling from the past, and a stopping criterion for evolutionary algorithms. Accordingly, a method to stop a generic evolutionary algorithm is proposed. Some computational experiments are carried out to test the stopping criterion, using a modified version of coupling from the past. Empirical evidence is shown to support the suitability of the criterion.