arrow
Return

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
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Evolutionary computation
Spherical search
Exploration and exploitation
Adaptive population control
Memory-based strategy

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

U
University of Toyama
Scholars:
6.3K
Papers: 5.2K
Citations: 3.9K
T
tongji university
Scholars:
7.8W
Papers: 5.9W
Citations: 98
N
Nanjing Forestry University
Scholars:
2.0W
Papers: 1.6W
Citations: 3.2W
researcher View more organizations