On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapes

This work demonstrates how the efficiency of evolutionary algorithms in dynamic environments can be improved by use of life-time adaptation. Our results contradict the hypothesis that there would be a tradeoff between designing and tuning EAs for static and dynamic environments, in which improved efficiency in one type of environment would decrease the efficiency in the other. In contrast, we show that the inclusion of life-time adaptation can result in EAs that outperform traditional EAs in both static and dynamic environments. Since the performance of EAs with life-time adaptation in dynamic environments are currently poorly understood at best, we conduct an extensive evaluation of the performance of these EAs on combinatorial and continuous dynamic global optimization problems with well-defined characteristics. In doing so, we propose improved benchmark dynamic fitness functions for both the combinatorial and continuous domains, which we have termed random dynamics NK-landscapes and structured moving peaks landscapes, respectively.

[1]  Jason M. Daida,et al.  Optimal Mutation and Crossover Rates for a Genetic Algorithm Operating in a Dynamic Environment , 1998, Evolutionary Programming.

[2]  Hajime Kita,et al.  Adaptation to a Changing Environment by Means of the Feedback Thermodynamical Genetic Algorithm , 1996, PPSN.

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

[4]  David H. Ackley,et al.  Interactions between learning and evolution , 1991 .

[5]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[6]  L. Darrell Whitley,et al.  Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.

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

[8]  Stefano Nolfi,et al.  Co-evolving predator and prey robots , 1998, Artificial Life.

[9]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[11]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

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

[13]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

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

[16]  L. Darrell Whitley,et al.  Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect , 1993, Evolutionary Computation.

[17]  Björn Olsson,et al.  On the Behavior of Evolutionary Global-Local Hybrids with Dynamic Fitness Functions , 2002, PPSN.

[18]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

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

[20]  Christoph F. Eick,et al.  Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors , 1997, Evolutionary Programming.

[21]  Ralf Salomon,et al.  Adaptation on the Evolutionary Time Scale: A Working Hypothesis and Basic Experiments , 1997, Artificial Evolution.

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

[23]  C. Wilke,et al.  Adaptive walks on time-dependent fitness landscapes. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[24]  Philippe Collard,et al.  An Evolutionary Approach for Time Dependent Optimization , 1997, Int. J. Artif. Intell. Tools.

[25]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[26]  Takahiro Sasaki,et al.  Adaptation toward Changing Environments: Why Darwinian in Nature? , 1997 .

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

[28]  Terence C. Fogarty,et al.  A Comparative Study of Steady State and Generational Genetic Algorithms , 1996, Evolutionary Computing, AISB Workshop.

[29]  Geoffrey E. Hinton,et al.  How Learning Can Guide Evolution , 1996, Complex Syst..

[30]  B. Freisleben,et al.  Genetic algorithms for binary quadratic programming , 1999 .

[31]  Shu-Yuen Hwang,et al.  Using Disruptive Selection to Maintain Diversity in Genetic Algorithms , 1997, Applied Intelligence.

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

[33]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[34]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[35]  Takahiro Sasaki,et al.  Comparison between Lamarckian and Darwinian Evolution on a Model Using Neural Networks and Genetic Algorithms , 2000, Knowledge and Information Systems.

[36]  John J. Grefenstette,et al.  Evolvability in dynamic fitness landscapes: a genetic algorithm approach , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[37]  Emma Hart,et al.  A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems , 1998, PPSN.

[38]  W. Punch,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems , 1997 .

[39]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[41]  Philippe Collard,et al.  Time dependent optimization with a folding genetic algorithm , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[42]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[43]  S. Tsutsui,et al.  Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[44]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .