Sub-structural Niching in Non-stationary Environments

Niching enables a genetic algorithm (GA) to maintain diversity in a population It is particularly useful when the problem has multiple optima where the aim is to find all or as many as possible of these optima When the fitness landscape of a problem changes overtime, the problem is called non–stationary, dynamic or time–variant problem In these problems, niching can maintain useful solutions to respond quickly, reliably and accurately to a change in the environment In this paper, we present a niching method that works on the problem substructures rather than the whole solution, therefore it has less space complexity than previously known niching mechanisms We show that the method is responding accurately when environmental changes occur.

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

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

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

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

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

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

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

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

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

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

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

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

[13]  H. Kargupta,et al.  Computational processes of evolution and the gene expression messy genetic algorithm , 1996 .

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

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

[16]  D. Dasgupta.  Incorporating Redundancy and Gene Activation Mechanisms i n Genetic search for adapting to Non-Stationary Environments , 1995 .

[17]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

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

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

[20]  K. Deb,et al.  Rapid, Accurate Optimization of Diicult Problems Using Fast Messy Genetic Algorithms Rapid, Accurate Optimization of Diicult Problems Using Fast Messy Genetic Algorithms , 1993 .

[21]  Alden H. Wright,et al.  Efficient Linkage Discovery by Limited Probing , 2003, GECCO.

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

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

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

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

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

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

[28]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

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

[30]  Hussein A. Abbass,et al.  Oiling the Wheels of Change: The Role of Adaptive Automatic Problem Decomposition in Non-Stationary Environments , 2005, ArXiv.

[31]  W. K. George,et al.  University of Illinois at Urbana-Champain , 1997 .

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

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

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

[35]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

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