期刊
INFORMATION SCIENCES
卷 454, 期 -, 页码 59-72出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.04.062
关键词
Computationally expensive problems; Surrogate model; Radial basis function; Particle swarm optimization
资金
- National Natural Science Foundation of China [61472269, 61403272]
- State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, China
- Fund Program for the Scientific Activities of Selected Returned Overseas Professionals in Shanxi Province
- Shanxi Province Science Foundation [201601D021083]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据