Dynamic Multimodal Optimization: A Preliminary Study

  • Shi Cheng
  • , Hui Lu
  • , Yi Nan Guo
  • , Xiujuan Lei
  • , Jing Liang
  • , Junfeng Chen
  • , Yuhui Shi

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

Abstract

The benchmark problems have played a fundamental role in verifying the algorithm's search ability. A dynamic multimodal optimization (DMO) problem is defined as an optimization problem with multiple global optima and characteristics of global optima which are changed during the search process. Two cases are used to illustrate the application scenario of DMO. A set of benchmark functions on DMO, which contains eight problems, are proposed to show the difficulty of DMO. The properties of the proposed benchmark problems, such as the distribution of solutions, the scalability, the number of global/local optima, are discussed.

Original languageEnglish
Title of host publication2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages279-285
Number of pages7
ISBN (Electronic)9781728121536
DOIs
StatePublished - Jun 2019
Event2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Wellington, New Zealand
Duration: 10 Jun 201913 Jun 2019

Publication series

Name2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings

Conference

Conference2019 IEEE Congress on Evolutionary Computation, CEC 2019
Country/TerritoryNew Zealand
CityWellington
Period10/06/1913/06/19

Keywords

  • Benchmark functions
  • Dynamic multimodal optimization
  • Dynamic multimodal optimization problem
  • Swarm intelligence

Fingerprint

Dive into the research topics of 'Dynamic Multimodal Optimization: A Preliminary Study'. Together they form a unique fingerprint.

Cite this