Particle Swarm Optimization in Non-stationary Environments

In this paper, we study the use of particle swarm optimization (PSO) for a class of non-stationary environments. The dynamic problems studied in this work are restricted to one of the possible types of changes that can be produced over the fitness landscape. We propose a hybrid PSO approach (called HPSO_dyn), which uses a dynamic macromutation operator whose aim is to maintain diversity. In order to validate our proposed approach, we adopted the test case generator proposed by Morrison & De Jong [1], which allows the creation of different types of dynamic environments with a varying degree of complexity. The main goal of this research was to determine the advantages and disadvantages of using PSO in non-stationary environments. As part of our study, we were interested in analyzing the ability of PSO for tracking an optimum that changes its location over time, as well as the behavior of the algorithm in the presence of high dimensionality and multimodality.

[1]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[2]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[3]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[4]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[5]  Peter J. Angeline,et al.  Tracking Extrema in Dynamic Environments , 1997, Evolutionary Programming.

[6]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[7]  James Kennedy,et al.  Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review] , 1999, IEEE Transactions on Evolutionary Computation.

[8]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[9]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[10]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[11]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[13]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.

[14]  P. Suganthan.  Particle swarm optimiser with neighbourhood operator , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[15]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[16]  K. Parsopoulos,et al.  Stretching technique for obtaining global minimizers through Particle Swarm Optimization , 2001 .

[17]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

[18]  J. Kennedy.  Stereotyping: improving particle swarm performance with cluster analysis , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[19]  Philippe Collard,et al.  An evolutionary approach for time dependant optimization , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[20]  Gerry V. Dozier,et al.  Steady-State Evolutionary Path Planning, Adaptive Replacement, and Hyper-Diversity , 2000, PPSN.

[21]  J. Kennedy,et al.  Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[23]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[24]  Eugene C. Freuder,et al.  Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.

[25]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[26]  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).

[27]  Russell C. Eberhart,et al.  Human tremor analysis using particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[28]  A. Carlisle,et al.  Tracking changing extrema with adaptive particle swarm optimizer , 2002, Proceedings of the 5th Biannual World Automation Congress.

[29]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[30]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[31]  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).

[32]  Dipankar Dasgupta,et al.  Nonstationary Function Optimization using the Structured Genetic Algorithm , 1992, PPSN.

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

[34]  Richard M. Friedberg,et al.  A Learning Machine: Part I , 1958, IBM J. Res. Dev..

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

[36]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[37]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[38]  Kok Cheong Wong,et al.  A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization , 1995, ICGA.

[39]  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 .

[40]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[41]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[42]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[43]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[44]  Yoshikazu Fukuyama,et al.  A particle swarm optimization for reactive power and voltage control in electric power systems , 1999, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[45]  J. Kennedy.  Minds and Cultures: Particle Swarm Implications , 1997 .

[46]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[47]  David E. Goldberg,et al.  Diploidy and Dominance in Artificial Genetic Search , 1992, Complex Syst..

[48]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[49]  Chilukuri K. Mohan,et al.  Analysis of a simple particle swarm optimization system , 1998 .

[50]  James Kennedy,et al.  The Behavior of Particles , 1998, Evolutionary Programming.

[51]  George E. P. Box,et al.  Evolutionary Operation: a Method for Increasing Industrial Productivity , 1957 .

[52]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[53]  Hans-Joachim Wunderlich,et al.  Optimized synthesis techniques for testable sequential circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[54]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[55]  David G. Mitchell,et al.  Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[56]  Robert G. Reynolds,et al.  Evolutionary Programming VI , 1997, Lecture Notes in Computer Science.

[57]  Mark M. Millonas,et al.  Swarms, Phase Transitions, and Collective Intelligence , 1993, adap-org/9306002.

[58]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

[59]  Gerry Dozier,et al.  Adapting Particle Swarm Optimizationto Dynamic Environments , 2001 .

[60]  Yuhui Shi,et al.  Extracting rules from fuzzy neural network by particle swarm optimisation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[61]  Tim M. Blackwell,et al.  Swarms in Dynamic Environments , 2003, GECCO.

[62]  Stefano Nolfi,et al.  Learning to Adapt to Changing Environments in Evolving Neural Networks , 1996, Adapt. Behav..

[63]  Carlos A. Coello Coello,et al.  On the use of particle swarm optimization with multimodal functions , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[64]  T. Back,et al.  On the behavior of evolutionary algorithms in dynamic environments , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[65]  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).

[66]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[67]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[68]  Ronald W. Morrison,et al.  Designing Evolutionary Algorithms for Dynamic Environments , 2004, Natural Computing Series.

[69]  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).

[70]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[71]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

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

[73]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[74]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .