Opposition-based particle swarm algorithm with cauchy mutation

Particle swarm optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. This paper presents an Opposition-based PSO (OPSO) to accelerate the convergence of PSO and avoid premature convergence. The proposed method employs opposition-based learning for each particle and applies a dynamic Cauchy mutation on the best particle. Experimental results on many well- known benchmark optimization problems have shown that OPSO could successfully deal with those difficult multimodal functions while maintaining fast search speed on those simple unimodal functions in the function optimization.

[1]  Kalyan Veeramachaneni,et al.  Optimization Using Particle Swarms with Near Neighbor Interactions , 2003, GECCO.

[2]  Hamid R. Tizhoosh,et al.  Opposition-Based Reinforcement Learning , 2006, J. Adv. Comput. Intell. Intell. Informatics.

[3]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[4]  E. Ozcan,et al.  Particle swarm optimization: surfing the waves , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Russell C. Eberhart,et al.  Recent advances in particle swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[6]  Hamid R. Tizhoosh,et al.  Reinforcement Learning Based on Actions and Opposite Actions , 2005 .

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

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

[9]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[10]  Shahryar Rahnamayan,et al.  Opposition-Based Differential Evolution Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[11]  Hui Wang,et al.  A Hybrid Particle Swarm Algorithm with Cauchy Mutation , 2007, 2007 IEEE Swarm Intelligence Symposium.

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

[13]  Xiao-Feng Xie,et al.  Hybrid particle swarm optimizer with mass extinction , 2002, IEEE 2002 International Conference on Communications, Circuits and Systems and West Sino Expositions.

[14]  L. Dworsky.  An Introduction to Probability , 2008 .

[15]  T. Krink,et al.  Extending particle swarm optimisers with self-organized criticality , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[16]  Shahryar Rahnamayan,et al.  Opposition-Based Differential Evolution for Optimization of Noisy Problems , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[17]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[18]  Hamid R. Tizhoosh,et al.  Opposition-Based Learning: A New Scheme for Machine Intelligence , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[19]  Xiao-Feng Xie,et al.  DEPSO: hybrid particle swarm with differential evolution operator , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[20]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[21]  L. Coelho,et al.  Predictive Controller Tuning Using Modified Particle Swarm Optimization Based on Cauchy and Gaussian Distributions , 2005 .

[22]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[23]  M. N. Vrahatis,et al.  Objective function “stretching” to alleviate convergence to local minima , 2001 .