Parallel quantum-behaved particle swarm optimization

Quantum-behaved particle swarm optimization (QPSO), like other population-based algorithms, is intrinsically parallel. The master–slave (synchronous and asynchronous) and static subpopulation parallel QPSO models are investigated and applied to solve the inverse heat conduction problem of identifying the unknown boundary shape. The performance of all these parallel models is compared. The synchronous parallel QPSO can obtain better solutions, while the asynchronous parallel QPSO converges fast without idle waiting. The scalability of the static subpopulation parallel QPSO is not as good as the master–slave parallel model.

[1]  Yu-Lin He,et al.  Particle swarm optimization for determining fuzzy measures from data , 2011, Inf. Sci..

[2]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[3]  Chih-Min Lin,et al.  A robust self-learning PID control system design for nonlinear systems using a particle swarm optimization algorithm , 2011, Int. J. Mach. Learn. Cybern..

[4]  Nowostawski,et al.  [IEEE 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. KES\'99 - Adelaide, SA, Australia (31 Aug.-1 Sept. 1999)] 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410) - Par , 1999 .

[5]  Riccardo Poli,et al.  Parallel genetic algorithm taxonomy , 1999, 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410).

[6]  Byung-Il Koh,et al.  Parallel asynchronous particle swarm optimization , 2006, International journal for numerical methods in engineering.

[7]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[8]  Wenbo Xu,et al.  Particle swarm optimization with particles having quantum behavior , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Rajesh Kumar,et al.  A boundary restricted adaptive particle swarm optimization for data clustering , 2013, Int. J. Mach. Learn. Cybern..

[10]  Jun Sun,et al.  A global search strategy of quantum-behaved particle swarm optimization , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[11]  A. N. Tikhonov,et al.  Solutions of ill-posed problems , 1977 .

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

[13]  Wenbo Xu,et al.  Adaptive parameter control for quantum-behaved particle swarm optimization on individual level , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[14]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[15]  Jing Liu,et al.  Parameter Selection of Quantum-Behaved Particle Swarm Optimization , 2005, ICNC.