Solving problems with a mix of hard and soft constraints using modified infeasibility driven evolutionary algorithm (IDEA-M)

Most optimization problems in the field of engineering design involve constraints. These constraints are often due to statutory requirements (e.g. safety, physical laws, user requirements/functionality) and/or limits imposed on time and resources. Population based stochastic optimization algorithms are a preferred choice for solving design optimization problems due to their ability to deal with nonlinear black-box functions. Having a good constraint handling technique embedded within the algorithm is imperative for its good performance. With the final aim of achieving feasible optimum solutions, feasibility first techniques, i.e., those which prefer feasible solutions over infeasible, have been commonly used in the past. However, in recent studies more emphasis has been laid on intelligent use of infeasible solutions (instead of their indiscreet rejection) during the course of optimization; particularly because optimum solutions often lie on the constraint boundary. The preservation of good infeasible solutions in the population is likely to improve the convergence in constricted or disconnected feasible regions. In addition, it provides a set of marginally infeasible solutions for trade-off considerations. However, in the case of a problem consisting of a mix of hard (non-negotiable) and soft (negotiable) constraints, such trade-off solutions are practically useful if they violate the soft constraints only. In this paper, previously introduced Infeasibility Driven Evolutionary Algorithm (IDEA) is modified to deliver solutions which strictly satisfy the hard constraints and offer tradeoff solutions with respect to the soft constraints. The performance of the algorithm is demonstrated on three benchmark problems.

[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]  Efrn Mezura-Montes,et al.  Constraint-Handling in Evolutionary Optimization , 2009 .

[3]  U. Volk,et al.  Optimized multivariable predictive control of an industrial distillation column considering hard and soft constraints , 2003 .

[4]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[6]  Ángel Fernando Kuri Morales,et al.  A UNIVERSAL ECLECTIC GENETIC ALGORITHM FOR CONSTRAINED OPTIMIZATION , 2022 .

[7]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

[9]  Marc Schoenauer,et al.  ASCHEA: new results using adaptive segregational constraint handling , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[10]  Sana Ben Hamida,et al.  An Adaptive Algorithm for Constrained Optimization Problems , 2000, PPSN.

[11]  Carlos A. Coello Coello,et al.  Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .

[12]  Z. Michalewicz,et al.  Your brains and my beauty: parent matching for constrained optimisation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  Pei Yee Ho,et al.  Evolutionary constrained optimization using an addition of ranking method and a percentage-based tolerance value adjustment scheme , 2007, Inf. Sci..

[14]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[15]  Kalyanmoy Deb,et al.  A combined genetic adaptive search (GeneAS) for engineering design , 1996 .

[16]  Amitay Isaacs,et al.  Development of optimization methods to solve computationally expensive problems , 2009 .

[17]  Carlos A. Coello Coello,et al.  Constrained Optimization via Multiobjective Evolutionary Algorithms , 2008, Multiobjective Problem Solving from Nature.

[18]  Michael M. Skolnick,et al.  Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints , 1993, ICGA.

[19]  K. C. Seow,et al.  MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM , 2001 .

[20]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[21]  Frank Hoffmeister,et al.  Problem-Independent Handling of Constraints by Use of Metric Penalty Functions , 1996, Evolutionary Programming.

[22]  Zbigniew Michalewicz,et al.  GENOCOP: a genetic algorithm for numerical optimization problems with linear constraints , 1996, CACM.

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

[24]  Bart Selman,et al.  A general stochastic approach to solving problems with hard and soft constraints , 1996, Satisfiability Problem: Theory and Applications.

[25]  Henry A. Kautz,et al.  Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT , 1995 .

[26]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[27]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

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

[29]  Patrick D. Surry,et al.  The COMOGA Method: Constrained Optimisation by Multi-Objective Genetic Algorithms , 1997 .

[30]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[31]  Atidel B. Hadj-Alouane,et al.  A dual genetic algorithm for bounded integer programs James C. Bean, Atidel Ben Hadj-Alouane. , 1993 .

[32]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[33]  Jacques A. Ferland,et al.  A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints , 1996 .

[34]  Z. Michalewicz.  Genetic Algorithms , Numerical Optimization , and Constraints , 1995 .

[35]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

[36]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[37]  Zbigniew Michalewicz,et al.  Adaptive evolutionary planner/navigator for mobile robots , 1997, IEEE Trans. Evol. Comput..

[38]  D.A.G. Vieira,et al.  Treating constraints as objectives in multiobjective optimization problems using niched Pareto genetic algorithm , 2004, IEEE Transactions on Magnetics.

[39]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..