ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Evolutionary-Mean shift algorithm for dynamic multimodal function optimization

Cuevas, Erik*; Galvez, Jorge; Toski, Miguel; Avila, Karla
APPLIED SOFT COMPUTING2021-12DOI: 10.1016/j.asoc.2021.107880
9被引1阅读
引用收藏
分享

摘要

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.

学科与关键词

关键词
Dynamic optimization techniquesMultimodal optimizationMean shift method
相关
加载中…
  • Cluster-based differential evolution with Crowding Archive for niching in dynamic environments
    Mukherjee, Rohan; Patra, Gyana Ranjan; Kundu, Rupam; Das, Swagatam*Information Sciences, 2014, 267: 58-82.被引 52
  • PopDMMO: A general framework of population-based stochastic search algorithms for dynamic multimodal optimization
    Lin, Xin; Luo, Wenjian*; Xu, Peilan; Qiao, Yingying; Yang, ShengxiangSwarm and Evolutionary Computation, 2022, 68: 101011.被引 6
  • A fast density peak clustering based particle swarm optimizer for dynamic optimization
    Li, Fei*; Yue, Qiang; Liu, Yuanchao; Ouyang, Haibin; Gu, FangqingEXPERT SYSTEMS WITH APPLICATIONS, 2024, 236: 121254.被引 10
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2021-12
卷期
第 113 卷
页码
107880
DOI
10.1016/j.asoc.2021.107880
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE

作者

  • C

    Cuevas, Erik (通讯) (第一作者)

  • G

    Galvez, Jorge

查看全部 4 位作者收起作者
  • T

    Toski, Miguel

  • A

    Avila, Karla

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417