4.7 Article

Surrogate-assisted hierarchical particle swarm optimization

Journal

INFORMATION SCIENCES
Volume 454, Issue -, Pages 59-72

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.04.062

Keywords

Computationally expensive problems; Surrogate model; Radial basis function; Particle swarm optimization

Funding

  1. National Natural Science Foundation of China [61472269, 61403272]
  2. State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, China
  3. Fund Program for the Scientific Activities of Selected Returned Overseas Professionals in Shanxi Province
  4. Shanxi Province Science Foundation [201601D021083]

Ask authors/readers for more resources

Meta-heuristic algorithms, which require a large number of fitness evaluations before locating the global optimum, are often prevented from being applied to computationally expensive real-world problems where one fitness evaluation may take from minutes to hours, or even days. Although many surrogate-assisted meta-heuristic optimization algorithms have been proposed, most of them were developed for solving expensive problems up to 30 dimensions. In this paper, we propose a surrogate-assisted hierarchical particle swarm optimizer for high-dimensional problems consisting of a standard particle swarm optimization (PSO) algorithm and a social learning particle swarm optimization algorithm (SL-PSO), where the PSO and SL-PSO work together to explore and exploit the search space, and simultaneously enhance the global and local performance of the surrogate model. Our experimental results on seven benchmark functions of dimensions 30, 50 and 100 demonstrate that the proposed method is competitive compared with the state-of-the-art algorithms under a limited computational budget. (C) 2018 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available