Space-based initialization strategy for particle swarm optimization

Particle Swarm Optimization (PSO) is a population-based stochastic optimization algorithm that has been applied to various scientific and engineering problems. Despite its fast convergence speed, the original PSO is easy to fall into local optima when solving multi-modal functions. To address this problem, we present a novel initialization strategy, namely Space-based Initialization Strategy (SIS), to help PSO avoid local optima. We embed SIS into the standard PSO and form a novel PSO variant named SIS-PSO. The performance of SIS-PSO is validated by 13 benchmark functions and the experimental results demonstrate that the SIS enables PSO to achieve faster convergence speed and higher solution accuracy especially in multi-modal problems.

[1]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search , 2005, 2005 IEEE Congress on Evolutionary Computation.

[2]  Jun Zhang,et al.  Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[3]  Zhi-Hui Zhan,et al.  An Efficient Resource Allocation Scheme Using Particle Swarm Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[4]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[5]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[6]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[8]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, ANTS Conference.