Evolutionary-Mean shift algorithm for dynamic multimodal function optimization

被引:9
|
作者
Cuevas, Erik [1 ]
Galvez, Jorge [1 ]
Toski, Miguel [1 ]
Avila, Karla [1 ]
机构
[1] Univ Guadalajara, Dept Elect, CUCEI, Ave Revoluc 1500, Guadalajara, Jalisco, Mexico
关键词
Dynamic optimization techniques; Multimodal optimization; Mean shift method; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; GENETIC ALGORITHM; SEARCH; STRATEGIES; MODEL;
D O I
10.1016/j.asoc.2021.107880
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, many dynamic optimization algorithms based on metaheuristic methods have been proposed. Although these schemes are highly efficient in determining a single global optimum, they fail in locating multiple optimal solutions. The central goal of dynamic multimodal optimization is to detect multiple optimal solutions for an optimization problem where its objective function is modified over time. Locating many optimal solutions (global and local) in a dynamic multimodal optimization problem is particularly crucial for several applications since the best solution could not always be the best implementable alternative due to various practical limitations. In spite of its importance, the problem of dynamic multimodal optimization through evolutionary principles has been scarcely considered in the literature. On the other hand, mean shift is a non-parametric and iterative process for detecting local maxima in a density function represented by a set of samples. Mean shift maintains interesting adaptive characteristics that allow it to find local maxima under dynamic environments. In this paper, the mean shift scheme is proposed to detect global and local optima in dynamic optimization problems. In the proposed method, the search strategy of the mean shift is modified to consider not only the density but also the fitness value of the candidate solutions. A competitive memory, along with a dynamic strategy, has also been added to accelerate the convergence process by using important information from previous environments. As a result, the proposed approach can effectively identify most of the global and local optima in dynamic environments. To demonstrate the performance of the proposed algorithm, a set of comparisons with other well-known dynamic optimization methods has been conducted. The study considers the benchmark generator of the CEC competition for dynamic optimization. The experimental results suggest a very competitive performance of the proposed scheme in terms of accuracy and robustness. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] An improved immune evolutionary algorithm for multimodal function optimization
    Xu, Xuesong
    Zhang, Jing
    ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 3, PROCEEDINGS, 2007, : 641 - +
  • [2] A simple and effective evolutionary algorithm for multimodal function optimization
    Jiang, DZ
    Wu, ZJ
    Kang, LS
    Progress in Intelligence Computation & Applications, 2005, : 257 - 261
  • [3] Population climbing evolutionary algorithm for multimodal function global optimization
    Chen Ziyi
    Kang Lishan
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 553 - 559
  • [4] Constrained Multimodal Function Optimization using a Simple Evolutionary Algorithm
    Kimura, Shuhei
    Matsumura, Koki
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 447 - 454
  • [5] A dynamic niche genetic algorithm for multimodal function optimization
    School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China
    Tongji Daxue Xuebao, 2006, 5 (684-688):
  • [6] A clonal selection algorithm for dynamic multimodal function optimization
    Luo, Wenjian
    Lin, Xin
    Zhu, Tao
    Xu, Peilan
    SWARM AND EVOLUTIONARY COMPUTATION, 2019, 50
  • [7] Steady-state evolutionary algorithm for multimodal function global optimization
    Chen, ZY
    Kang, LS
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 2005, 3801 : 200 - 207
  • [8] A parallel global-local mixed evolutionary algorithm for multimodal function optimization
    Wu, ZJ
    Kang, LS
    Zou, XF
    FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2002, : 247 - 250
  • [9] A Shift Vector Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Dynamic Optimization
    Zhu, Zhen
    Tian, Xiang
    Xia, Changgao
    Chen, Long
    Cai, Yingfeng
    IEEE ACCESS, 2020, 8 : 38391 - 38403
  • [10] A Shift Vector Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Dynamic Optimization
    Zhu, Zhen
    Tian, Xiang
    Xia, Changgao
    Chen, Long
    Cai, Yingfeng
    IEEE Access, 2020, 8 : 38391 - 38403