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

German Hernandez, Fernando Nino, Kenneth Wilder, Julian Garcia

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

10 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationGECCO 2005 - Genetic and Evolutionary Computation Conference
EditorsH.G. Beyer, U.M. O'Reilly, D. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, al et al
Pages615-620
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventThe Genetic and Evolutionary Computation Conference 2005 - Washington, United States of America
Duration: 25 Jun 200529 Jun 2005

Conference

ConferenceThe Genetic and Evolutionary Computation Conference 2005
Abbreviated titleGECCO 2005
CountryUnited States of America
CityWashington
Period25/06/0529/06/05

Keywords

  • Coupling from the Past
  • Evolutionary Algorithms
  • Optimization
  • Stopping Criteria

Cite this

Hernandez, G., Nino, F., Wilder, K., & Garcia, J. (2005). Towards a self-stopping evolutionary algorithm using coupling from the past. In H. G. Beyer, U. M. O'Reilly, D. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, & A. et al (Eds.), GECCO 2005 - Genetic and Evolutionary Computation Conference (pp. 615-620) https://doi.org/10.1145/1068009.1068112