Termination detection strategies in evolutionary algorithms: A survey

Yanfeng Liu, Aimin Zhou, Hu Zhang

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

13 Scopus citations

Abstract

This paper provides an overview of developments on termination conditions in evolutionary algorithms (EAs). It seeks to give a representative picture of the termination conditions in EAs over the past decades, segment the contributions of termination conditions into progress indicators and termination criteria. With respect to progress indicators, we consider a variety of indicators, in particular in convergence indicators and diversity indicators. With respect to termination criteria, this paper reviews recent research on threshold strategy, statistical inference, i.e., Kalman filters, as well as Fuzzy methods, and other methods. Key developments on termination conditions over decades include: (i) methods of judging the algorithm's search behavior based on statistics, and (ii) methods of detecting the termination based on different distance formulations.

Original languageEnglish
Title of host publicationGECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference
PublisherAssociation for Computing Machinery, Inc
Pages1063-1070
Number of pages8
ISBN (Electronic)9781450356183
DOIs
StatePublished - 2 Jul 2018
Event2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
Duration: 15 Jul 201819 Jul 2018

Publication series

NameGECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference

Conference

Conference2018 Genetic and Evolutionary Computation Conference, GECCO 2018
Country/TerritoryJapan
CityKyoto
Period15/07/1819/07/18

Keywords

  • Evolutionary Algorithms
  • Progress Indicators
  • Termination Conditions
  • Termination Criteria

Fingerprint

Dive into the research topics of 'Termination detection strategies in evolutionary algorithms: A survey'. Together they form a unique fingerprint.

Cite this