Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments

Fitness landscapes of real world problems are in general considered to be complex and often with both local and global peaks. In the static case the local peaks are interesting because they represent other potential solutions to the problem. In dynamic problems the fitness landscape changes over time, so a local optimum might rise and become the new global optimum. In this context it would be beneficial to search for both local and global optima, because the algorithm would then have performed most of the search when the global optimum change. This paper describes the multinational GA and its application to six dynamic problems. The multinational GA is a self-organized genetic algorithm for multimodal optimization, which structures the population into subpopulations based on a method for detecting valleys in the fitness landscape. The experiments showed that multimodal optimization techniques are useful when optimizing dynamic problems with multiple peaks. A non-adaptive version was tested against a self-adaptive algorithm with genetic encoded parameters. The self-adaptive version outperformed the non-adaptive on a simple dynamic problem. However, this was not the case on a slightly more complex problem.

[1]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

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

[3]  Thomas Bck,et al.  Self-adaptation in genetic algorithms , 1991 .

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

[5]  Hideyuki Takagi,et al.  Dynamic Control of Genetic Algorithms Using Fuzzy Logic Techniques , 1993, ICGA.

[6]  D. Goldberg,et al.  Adaptive Niching via coevolutionary Sharing , 1997 .

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

[9]  Mark Wineberg,et al.  The Shifting Balance Genetic Algorithm: improving the GA in a dynamic environment , 1999 .

[10]  R. K. Ursem Multinational evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[11]  K. De Jong,et al.  The usefulness of tag bits in changing environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).