Tackling Dynamic Problems with Multiobjective Evolutionary Algorithms

In this chapter, we discuss the use of multiobjective evolutionary algorithms (MOEAs) for solving single-objective optimization problems in dynamic environments. Specifically, we investigate the consideration of a second (artificial) objective, with the aim of maintaining greater population diversity and adaptability. The paper suggests and compares a number of alternative ways to express this second objective. An empirical comparison shows that the best alternatives are competitive with other evolutionary algorithm variants designed for handling dynamic environments.

[1]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..

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

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

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

[5]  Hussein A. Abbass,et al.  Multiobjective optimization for dynamic environments , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

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

[8]  Shengxiang Yang,et al.  Memory-based immigrants for genetic algorithms in dynamic environments , 2005, GECCO '05.

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

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

[11]  Ernesto Benini,et al.  Genetic Diversity as an Objective in Multi-Objective Evolutionary Algorithms , 2003, Evolutionary Computation.

[12]  Von der Fakult Evolutionary Algorithms and Dynamic Optimization Problems , 2003 .

[13]  Ivo F. Sbalzariniy,et al.  Multiobjective optimization using evolutionary algorithms , 2000 .

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

[15]  Hussein A. Abbass,et al.  Searching under Multi-evolutionary Pressures , 2003, EMO.

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

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

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

[19]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[20]  Mikkel T. Jensen,et al.  Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation , 2004, J. Math. Model. Algorithms.

[21]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[22]  Karsten Weicker,et al.  Evolutionary algorithms and dynamic optimization problems , 2003 .

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

[24]  Shengxiang Yang,et al.  Associative Memory Scheme for Genetic Algorithms in Dynamic Environments , 2006, EvoWorkshops.

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

[26]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[27]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

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

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

[30]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.