An adaptive surrogate-assisted particle swarm optimization for expensive problems

X Li, S Li - Soft Computing, 2021 - Springer
X Li, S Li
Soft Computing, 2021Springer
To solve engineering problems with evolutionary algorithms, many expensive function
evaluations (FEs) are required. To alleviate this difficulty, surrogate-assisted evolutionary
algorithms (SAEAs) have attracted increasingly more attention in both academia and
industry. Most existing SAEAs either waste computational resources due to the lack of
accuracy of the surrogate model or easily fall into the local optimum as the dimension
increases. To address these problems, this paper proposes an adaptive surrogate-assisted …
Abstract
To solve engineering problems with evolutionary algorithms, many expensive function evaluations (FEs) are required. To alleviate this difficulty, surrogate-assisted evolutionary algorithms (SAEAs) have attracted increasingly more attention in both academia and industry. Most existing SAEAs either waste computational resources due to the lack of accuracy of the surrogate model or easily fall into the local optimum as the dimension increases. To address these problems, this paper proposes an adaptive surrogate-assisted particle swarm optimization algorithm. In the proposed algorithm, a surrogate model is adaptively selected from a single model and an ensemble model by comparing the best existing solution and the latest obtained solution. Additionally, a model output criterion based on the standard deviation is suggested to improve the stability and generalization ability of the ensemble model. To verify the performance of the proposed algorithm, 10 benchmark functions with different modalities from 10 to 50 dimensions are tested, and the results are compared with those of five state-of-the-art SAEAs. The experimental results indicate that the proposed algorithm performs well for most benchmark functions within a limited number of FEs. Moreover, the performance of the proposed algorithm in solving engineering problems is verified by applying the algorithm to the PX oxidation process.
Springer
Showing the best result for this search. See all results