.png){kind=icon}
.png){kind=icon}
Return
A Surrogate-Assisted Multiswarm Optimization Algorithm for High-Dimensional Computationally Expensive Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2020.2967553.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a surrogate-assisted multiswarm optimization (SAMSO) algorithm for high-dimensional computationally expensive problems. The proposed algorithm includes two swarms: the first one uses the learner phase of teaching-learning-based optimization (TLBO) to enhance exploration and the second one uses the particle swarm optimization (PSO) for faster convergence. These two swarms can learn from each other. A dynamic swarm size adjustment scheme is proposed to control the evolutionary progress. Two coordinate systems are used to generate promising positions for the PSO in order to further enhance its search efficiency on different function landscapes. Moreover, a novel prescreening criterion is proposed to select promising individuals for exact function evaluations. Several commonly used benchmark functions with their dimensions varying from 30 to 200 are adopted to evaluate the proposed algorithm. The experimental results demonstrate the superiority of the proposed algorithm over three state-of-the-art algorithms.
Keywords:
Optimization
Iron
Particle swarm optimization
Sociology
Statistics
Education
Search problems
Computationally expensive problems
multiswarm optimization
particle swarm optimization (PSO)
surrogate model
teaching-learning-based optimization (TLBO)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available