Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems

418Citations
Citations of this article
165Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Surrogate models have shown to be effective in assisting metaheuristic algorithms for solving computationally expensive complex optimization problems. The effectiveness of existing surrogate-assisted metaheuristic algorithms, however, has only been verified on low-dimensional optimization problems. In this paper, a surrogate-assisted cooperative swarm optimization algorithm is proposed, in which a surrogate-assisted particle swarm optimization (PSO) algorithm and a surrogate-assisted social learning-based PSO (SL-PSO) algorithm cooperatively search for the global optimum. The cooperation between the PSO and the SL-PSO consists of two aspects. First, they share promising solutions evaluated by the real fitness function. Second, the SL-PSO focuses on exploration while the PSO concentrates on local search. Empirical studies on six 50-D and six 100-D benchmark problems demonstrate that the proposed algorithm is able to find high-quality solutions for high-dimensional problems on a limited computational budget.

Cite

CITATION STYLE

APA

Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017). Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems. IEEE Transactions on Evolutionary Computation, 21(4), 644–660. https://doi.org/10.1109/TEVC.2017.2675628

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free