Adaptive Primal–Dual Genetic Algorithms in Dynamic Environments

Recently, there has been an increasing interest in applying genetic algorithms (GAs) in dynamic environments. Inspired by the complementary and dominance mechanisms in nature, a primal-dual GA (PDGA) has been proposed for dynamic optimization problems (DOPs). In this paper, an important operator in PDGA, i.e., the primal-dual mapping (PDM) scheme, is further investigated to improve the robustness and adaptability of PDGA in dynamic environments. In the improved scheme, two different probability-based PDM operators, where the mapping probability of each allele in the chromosome string is calculated through the statistical information of the distribution of alleles in the corresponding gene locus over the population, are effectively combined according to an adaptive Lamarckian learning mechanism. In addition, an adaptive dominant replacement scheme, which can probabilistically accept inferior chromosomes, is also introduced into the proposed algorithm to enhance the diversity level of the population. Experimental results on a series of dynamic problems generated from several stationary benchmark problems show that the proposed algorithm is a good optimizer for DOPs.

[1]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

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

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

[4]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.

[5]  Shengxiang Yang,et al.  Hyper-learning for population-based incremental learning in dynamic environments , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[7]  Houjun Wang,et al.  Improved Genetic Algorithms Based Path planning of Mobile Robot Under Dynamic Unknown Environment , 2006, 2006 International Conference on Mechatronics and Automation.

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

[9]  R.W. Morrison,et al.  Triggered hypermutation revisited , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

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

[12]  Shengxiang Yang,et al.  Non-stationary problem optimization using the primal-dual genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[13]  Ming Kim Lim,et al.  Dynamically Integrated Manufacturing Systems (DIMS)—A Multiagent Approach , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[15]  Shengxiang Yang,et al.  Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments , 2008, Evolutionary Computation.

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

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

[18]  Yoshikane Takahashi,et al.  A mathematical framework for solving dynamic optimization problems with adaptive networks , 1998, IEEE Trans. Syst. Man Cybern. Part C.

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

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

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

[22]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[23]  Shengxiang Yang,et al.  Hyper-selection in dynamic environments , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[24]  E. Gelenbe,et al.  Genetic Algorithms for Route Discovery , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Shengxiang Yang,et al.  Triggered Memory-Based Swarm Optimization in Dynamic Environments , 2007, EvoWorkshops.

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

[27]  Dingwei Wang,et al.  An Improved Primal-Dual Genetic Algorithm for Optimization in Dynamic Environments , 2006, ICONIP.

[28]  Kalyanmoy Deb,et al.  Dynamic multiobjective optimization problems: test cases, approximations, and applications , 2004, IEEE Transactions on Evolutionary Computation.

[29]  Hongfeng Wang,et al.  A new dual scheme for genetic algorithm in dynamic environments , 2008, 2008 Chinese Control and Decision Conference.

[30]  Shengxiang Yang,et al.  Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems , 2007, EvoWorkshops.

[31]  Weiguo Sheng,et al.  A weighted sum validity function for clustering with a hybrid niching genetic algorithm , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[33]  A. Sima Etaner-Uyar,et al.  A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments , 2005, Soft Comput..

[34]  Terence C. Fogarty,et al.  Adaptive Combustion Balancing in Multiple Burner Boiler Using a Genetic Algorithm with Variable Range of Local Search , 1997, ICGA.

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

[36]  Kay Chen Tan,et al.  A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[37]  Steven Guan,et al.  Incremental multiple objective genetic algorithms , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).