Dynamic Multimodal Optimization: A Preliminary Study

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

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.