跳到主要导航 跳到搜索 跳到主要内容

Termination detection strategies in evolutionary algorithms: A survey

  • Yanfeng Liu
  • , Aimin Zhou*
  • , Hu Zhang
  • *此作品的通讯作者
  • East China Normal University
  • Beijing Electro-mechanical Engineering Institute

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference
出版商Association for Computing Machinery, Inc
1063-1070
页数8
ISBN(电子版)9781450356183
DOI
出版状态已出版 - 2 7月 2018
活动2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, 日本
期限: 15 7月 201819 7月 2018

出版系列

姓名GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference

会议

会议2018 Genetic and Evolutionary Computation Conference, GECCO 2018
国家/地区日本
Kyoto
时期15/07/1819/07/18

指纹

探究 'Termination detection strategies in evolutionary algorithms: A survey' 的科研主题。它们共同构成独一无二的指纹。

引用此