Oiling the Wheels of Change: The Role of Adaptive Automatic Problem Decomposition in Non-Stationary Environments

Genetic algorithms (GAs) that solve hard problems quickly, reliably and accurately are called competent GAs. When the fitness landscape of a problem changes overtime, the problem is called non--stationary, dynamic or time--variant problem. This paper investigates the use of competent GAs for optimizing non--stationary optimization problems. More specifically, we use an information theoretic approach based on the minimum description length principle to adaptively identify regularities and substructures that can be exploited to respond quickly to changes in the environment. We also develop a special type of problems with bounded difficulties to test non--stationary optimization problems. The results provide new insights into non-stationary optimization problems and show that a search algorithm which automatically identifies and exploits possible decompositions is more robust and responds quickly to changes than a simple genetic algorithm.

[1]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[2]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[3]  Petr Posík Estimation of Distribution Algorithms , 2006 .

[4]  Kumara Sastry,et al.  Efficient Atomic Cluster Optimization Using A Hybrid Extended Compact Genetic Algorithm With Seeded , 2001 .

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

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

[7]  G. Harik Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[8]  David E. Goldberg,et al.  Modified Linkage Learning Genetic Algorithm For Difficult Non-stationary Problems , 2002, GECCO.

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

[10]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

[11]  Jorma Rissanen,et al.  Fisher information and stochastic complexity , 1996, IEEE Trans. Inf. Theory.

[12]  Dirk Thierens,et al.  Linkage Information Processing In Distribution Estimation Algorithms , 1999, GECCO.

[13]  David E. Goldberg,et al.  From Twomax To The Ising Model: Easy And Hard Symmetrical Problems , 2002, GECCO.

[14]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[15]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[16]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[17]  David E. Goldberg,et al.  The Race, the Hurdle, and the Sweet Spot , 1998 .

[18]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[19]  David E. Goldberg,et al.  Designing a competent simple genetic algorithm for search and optimization , 2000 .

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

[21]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[22]  Dirk Thierens,et al.  On the Design and Analysis of Competent Selecto-recombinative GAs , 2004, Evolutionary Computation.

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

[24]  David E. Goldberg,et al.  Bayesian optimization algorithm: from single level to hierarchy , 2002 .

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

[26]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[27]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[28]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[29]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[30]  Terence C. Fogarty,et al.  Learning the local search range for genetic optimisation in nonstationary environments , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[31]  David E. Goldberg,et al.  Linkage Identification by Non-monotonicity Detection for Overlapping Functions , 1999, Evolutionary Computation.

[32]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[33]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

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

[35]  Ying-ping Chen,et al.  Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice , 2004 .

[36]  Mark Wineberg,et al.  Enhancing the GA's Ability to Cope with Dynamic Environments , 2000, GECCO.

[37]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[38]  B. Minsker,et al.  Cost‐effective long‐term groundwater monitoring design using a genetic algorithm and global mass interpolation , 2000 .

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

[40]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[41]  Fernando G. Lobo,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[42]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[43]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[44]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

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

[46]  Alden H. Wright,et al.  Efficient Linkage Discovery by Limited Probing , 2003, Evolutionary Computation.

[47]  D. Dasgupta Incorporating Redundancy and Gene Activation Mechanisms in Genetic search for adapting to Non-Stationarv Environments. , 2019, Practical Handbook of Genetic Algorithms.

[48]  D. Goldberg,et al.  Building block superiority, multimodality and synchronization problems , 2001 .

[49]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[51]  Hajime Kita,et al.  Adaptation to Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm , 1997, ICGA.

[52]  David E. Goldberg,et al.  Introducing Start Expression Genes to the Linkage Learning Genetic Algorithm , 2002, PPSN.

[53]  David E. Goldberg,et al.  Genetic Algorithm Design Inspired by Organizational Theory: Pilot Study of a Dependency Structure Matrix Driven Genetic Algorithm , 2003, GECCO.

[54]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[55]  H. Kargupta Search, polynomial complexity, and the fast messy genetic algorithm , 1996 .

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

[57]  Robert G. Reynolds,et al.  Evolutionary computation: Towards a new philosophy of machine intelligence , 1997 .

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

[59]  Rasmus K. Ursem,et al.  Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments , 2000, GECCO.