The behavior of spatially distributed evolutionary algorithms in non-stationary environments

Traditional EAs lose diversity fairly quickly due to the strong selection pressures used to achieve good optimization performance, and thus have difficulty with non-stationary environments (fitness landscapes) unless significant algorithmic changes are made. Decentralized and spatially distributed EAs intuitively appear to be more robust in their ability to perform well in both stationary and non-stationary problem domains. We explore this hypothesis with a set of empirical studies that, although preliminary in nature, supports this claim and provides some additional insights into properties of spatially distributed EAs.

[1]  K. De Jong,et al.  Selection pressure and performance in spatially distributed evolutionary algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  Terence C. Fogarty,et al.  A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments , 1996, PPSN.

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

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

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

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

[7]  Kathleen M. Swigger,et al.  An Analysis of Genetic-Based Pattern Tracking and Cognitive-Based Component Tracking Models of Adaptation , 1983, AAAI.

[8]  David R. Jefferson,et al.  Selection in Massively Parallel Genetic Algorithms , 1991, ICGA.

[9]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[10]  Kenneth A. De Jong,et al.  An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm , 1997, ICGA.

[11]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[12]  Kenneth A. De Jong,et al.  An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms , 1996, PPSN.

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

[14]  Bernard Manderick,et al.  A Massively Parallel Genetic Algorithm: Implementation and First Analysis , 1991, ICGA.

[15]  John Michael Neal McInerney,et al.  Biologically influenced algorithms and parallelism in non-linear optimization , 1992 .

[16]  Terence C. Fogarty,et al.  Adaptive Combustion Balancing in Multiple Burner Boiler Using a Genetic Algorithm with Variable Range of Local Search , 1997, ICGA.

[17]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .