Improved barebones particle swarm optimization with neighborhood search and its application on ship design

Abstract

Barebones particle swarmoptimization (BPSO) is a new PSO variant, which has shown a good performance onmany optimization problems. However, similar to the standard PSO, BPSO also suffers from premature convergence when solving complex optimization problems. In order to improve the performance of BPSO, this paper proposes a new BPSO variant called BPSO with neighborhood search (NSBPSO) to achieve a tradeoff between exploration and exploitation during the search process. Experiments are conducted on twelve benchmark functions and a real-world problem of ship design. Simulation results demonstrate that our approach outperforms the standard PSO, BPSO, and six other improved PSO algorithms. Copyright © 2013 J. Yao and D. Han.