Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems

A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization problems. Most of such algorithms inherently prefer a feasible solution over an infeasible one during the course of search, which translates to approaching the constraint boundary from the feasible side of the search space. Previous studies [1], [2] have already demonstrated the benefits of explicitly maintaining a fraction of infeasible solutions in Infeasiblity Driven Evolutionary Algorithm (IDEA) for single and multiobjective constrained optimization problems. In this paper, the benefits of IDEA as a sub-evolve mechanism are highlighted for dynamic, constrained single objective optimization problems. IDEA is particularly attractive for such problems as it offers a faster rate of convergence over a conventional EA, which is of significant interest in dynamic optimization problems. The algorithm is tested on two new dynamic constrained test problems. For both the problems, the performance of IDEA is found to be significantly better than conventional EA.

[1]  Tapabrata Ray,et al.  Blessings of maintaining infeasible solutions for constrained multi-objective optimization problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

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

[4]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

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

[6]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[7]  Tapabrata Ray,et al.  A Memetic Algorithm for Dynamic Multiobjective Optimization , 2009 .

[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]  Sana Ben Hamida,et al.  An Adaptive Algorithm for Constrained Optimization Problems , 2000, PPSN.

[10]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[11]  R. Lyndon While,et al.  Multi-level Ranking for Constrained Multi-objective Evolutionary Optimisation , 2006, PPSN.

[12]  Xin Yao,et al.  Benchmarking and solving dynamic constrained problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[13]  C. Coello,et al.  CONSTRAINT-HANDLING USING AN EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION TECHNIQUE , 2000 .

[14]  Tapabrata Ray,et al.  Infeasibility Driven Evolutionary Algorithm (IDEA) for Engineering Design Optimization , 2008, Australasian Conference on Artificial Intelligence.

[15]  David Wallace,et al.  Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach , 2006, GECCO '06.

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

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

[18]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[19]  Douglas A. G. Vieira,et al.  Handling constraints as objectives in a multiobjective genetic based algorithm , 2002 .

[20]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[21]  Shengxiang Yang,et al.  A self-organizing random immigrants genetic algorithm for dynamic optimization problems , 2007, Genetic Programming and Evolvable Machines.

[22]  Tapabrata Ray,et al.  Infeasibility Driven Evolutionary Algorithm for Constrained Optimization , 2009 .

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

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

[25]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .