Cooperative particle swarm optimization in dynamic environments

Most optimization algorithms are designed to solve static, unchanging problems. However, many real-world problems exhibit dynamic behavior. Particle swarm optimization (PSO) is a successful metaheuristic methodology which has been adapted for locating and tracking optima in dynamic environments. Recently, a powerful new class of PSO strategies using cooperative principles was shown to improve PSO performance in static environments. While there exist many PSO algorithms designed for dynamic optimization problems, only one cooperative PSO strategy has been introduced for this purpose, and it has only been studied under one type of dynamism. This study proposes a new cooperative PSO strategy designed for dynamic environments. The newly proposed algorithm is shown to achieve significantly lower error rates when compared to well-known algorithms across problems with varying dimensionalities, temporal change severities, and spatial change severities.

[1]  Russell C. Eberhart,et al.  Tracking and optimizing dynamic systems with particle swarms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[2]  Gerry Dozier,et al.  Applying the particle swarm optimizer to non-stationary environments , 2002 .

[3]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[4]  Peter J. Bentley,et al.  Dynamic Search With Charged Swarms , 2002, GECCO.

[5]  Jürgen Branke,et al.  Multi-swarm Optimization in Dynamic Environments , 2004, EvoWorkshops.

[6]  Jürgen Branke,et al.  Multiswarms, exclusion, and anti-convergence in dynamic environments , 2006, IEEE Transactions on Evolutionary Computation.

[7]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

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

[9]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[10]  Helen G. Cobb,et al.  An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .

[11]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[12]  Andries Petrus Engelbrecht,et al.  Cooperative charged particle swarm optimiser , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[13]  Xin Yao,et al.  Benchmark Generator for CEC'2009 Competition on Dynamic Optimization , 2008 .

[14]  Mohammed El-Abd,et al.  Cooperative models of particle swarm optimizers , 2008 .

[15]  Russell C. Eberhart,et al.  Adaptive particle swarm optimization: detection and response to dynamic systems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[16]  Andries Petrus Engelbrecht,et al.  Towards a more complete classification system for dynamically changing environments , 2012, 2012 IEEE Congress on Evolutionary Computation.

[17]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[18]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization: Velocity initialization , 2012, 2012 IEEE Congress on Evolutionary Computation.

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

[20]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[21]  Changhe Li,et al.  A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization , 2008, SEAL.

[22]  Xiaodong Li,et al.  Comparing particle swarms for tracking extrema in dynamic environments , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[23]  Karsten Weicker,et al.  An Analysis of Dynamic Severity and Population Size , 2000, PPSN.

[24]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[25]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[26]  R.W. Morrison,et al.  A test problem generator for non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[27]  Xiaodong Li,et al.  Particle Swarms for Dynamic Optimization Problems , 2008, Swarm Intelligence.

[28]  S. Holm.  A Simple Sequentially Rejective Multiple Test Procedure , 1979 .

[29]  Andries Petrus Engelbrecht,et al.  CIlib: A collaborative framework for Computational Intelligence algorithms - Part I , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[30]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[31]  Kenneth A. De Jong,et al.  Evolving in a Changing World , 1999, ISMIS.

[32]  Karsten Weicker,et al.  Performance Measures for Dynamic Environments , 2002, PPSN.