.png){kind=icon}
.png){kind=icon}
Return
Sequential approximation optimization assisted particle swarm optimization for expensive problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2019.105659.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, an efficient sequential approximation optimization assisted particle swarm optimization algorithm is proposed for optimization of expensive problems. This algorithm makes a good balance between the search ability of particle swarm optimization and sequential approximation optimization. Specifically, the proposed algorithm uses the optima obtained by sequential approximation optimization in local regions to replace the personal historical best particles and then runs the basic particle swarm optimization procedures. Compared with particle swarm optimization, the proposed algorithm is more efficient because the optima provided by sequential approximation optimization can direct swarm particles to search in a more accurate way. In addition, a space partition strategy is proposed to constraint sequential approximation optimization in local regions. This strategy can enhance the swarm diversity and prevent the preconvergence of the proposed algorithm. In order to validate the proposed algorithm, a lot of numerical benchmark problems are tested. An overall comparison between the proposed algorithm and several other optimization algorithms has been made. Finally, the proposed algorithm is applied to an optimal design of bearings in an all-direction propeller. The results show that the proposed algorithm is efficient and promising for optimization of the expensive problems. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Particle swarm optimization
Sequential approximation optimization
Space partition
Expensive problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
No organization information available