arrow
返回

Spherical search algorithm with memory-guided population stage-wise control for bound-constrained global optimization problems

delete2024-08-01
delete3
PRE
AI
S
Sichen Tao
K
Kaiyu Wang
T
Ting Jin *
Z
Zhengwei Wu
Z
Zhenyu Lei
S
Shangce Gao
DOI:10.1016/j.asoc.2024.111677delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The recently proposed Spherical Search (SS) algorithm replaces the traditional square search pattern with a spherical boundary to provide position-diverse solutions. The algorithm balances its exploration and exploitation performance by utilizing 2 exploration and exploitation sub-populations of equal size. SS has been proven to be highly competitive. However, we observed that when it is used to solve a variety of problems as well as during different searching stages, the fixed sub-population size limits its adaptability and flexibility for achieving continuous exploitation-exploration balance. The balance potential of two operators with distinct characteristics is underdeveloped. As a result, SS and its advanced variants are prone to still easily falling into local optima and lacks certain performance advantages over peer algorithms. In this paper, we further develop SS and propose a memory-guided population stage-wise control strategy based SS, called SSM. By our proposed memory-guided stage-wise evaluation mechanism, SS evaluates the exploitation-exploration balance extent in real time and thus adaptively optimizes and predicts better resource allocation ratio values between its 2 sub-populations and thus achieves significant performance advantages over peer algorithms. The experiments are conducted on 120 benchmark functions and 22 real-world problems, and the results show that SSM significantly outperforms other 13 state-of-the-art evolutionary algorithms. Additionally, we conduct analyses based on method characteristics, convergence process, solution quality robustness testing, population diversity, exploitation and exploration balance, and computational complexity.
Keyword:
Evolutionary computation
Spherical search
Exploration and exploitation
Adaptive population control
Memory-based strategy

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

U
University of Toyama
学者数:
6.3K
论文数: 5.2K
被引数: 3.9K
T
tongji university
学者数:
7.9W
论文数: 6.0W
被引数: 98
N
Nanjing Forestry University
学者数:
2.0W
论文数: 1.6W
被引数: 3.2W
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Grey Wolf Optimizer灰狼优化器
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
err分享
err收藏
Identification of 11 Novel Homogentisate 1,2 Dioxygenase Variants in Alkaptonuria Patients and Establishment of a Novel LOVD-Based HGD Mutation Database
err2011-10-20
err0
errOAAI
errAndrea Zatkova; Tatiana Sedlackova; Jan Radvansky; Helena Polakova; Martina Nemethova; Robert Aquaron; Ismail Dursun; Jeannette L. Usher; Ludevit Kadasi
err分享
err收藏
A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades-Part B
err2021-08-01
err59
errOAAI
errYazdani, Danial; Cheng, Ran; Yazdani, Donya; Branke, Jurgen; Jin, Yaochu; Yao, Xin
err分享
err收藏
Low sociability is associated with reduced size of the corpus callosum in the BALB/cJ inbred mouse strain
err2008-09-01
err0
errOAAI
errAndrew H. Fairless; Holly C. Dow; Monica M. Toledo; Kristen A. Malkus; Michele Edelmann; Hongzhe Li; Konrad Talbot; Steven E. Arnold; Ted Abel; Edward S. Brodkin
err分享
err收藏
A better balance in metaheuristic algorithms: Does it exist?元启发式算法中的更好平衡: 它是否存在?
err2020-05-01
err246
PREAI
errMorales-Castaneda, Bernardo; Zaldivar, Daniel; Cuevas, Erik; Fausto, Fernando; Rodriguez, Alma
err分享
err收藏
Particle Swarm Optimization: A Comprehensive Survey
err2022-01-01
err545
errOAAI
errShami, Tareq M.; El-Saleh, Ayman A.; Alswaitti, Mohammed; Al-Tashi, Qasem; Summakieh, Mhd Amen; Mirjalili, Seyedali
err分享
err收藏
学者 查看更多内容