Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization

Evolutionary algorithms (EAs) are being routinely applied for a variety of optimization tasks, and real-parameter optimization in the presence of constraints is one such important area. During constrained optimization EAs often create solutions that fall outside the feasible region; hence a viable constraint-handling strategy is needed. This paper focuses on the class of constraint-handling strategies that repair infeasible solutions by bringing them back into the search space and explicitly preserve feasibility of the solutions. Several existing constraint-handling strategies are studied, and two new single parameter constraint-handling methodologies based on parent-centric and inverse parabolic probability (IP) distribution are proposed. The existing and newly proposed constraint-handling methods are first studied with PSO, DE, GAs, and simulation results on four scalable test-problems under different location settings of the optimum are presented. The newly proposed constraint-handling methods exhibit robustness in terms of performance and also succeed on search spaces comprising up-to $$500$$500 variables while locating the optimum within an error of $$10^{-10}$$10-10. The working principle of the IP based methods is also demonstrated on (i) some generic constrained optimization problems, and (ii) a classic ‘Weld’ problem from structural design and mechanics. The successful performance of the proposed methods clearly exhibits their efficacy as a generic constrained-handling strategy for a wide range of applications.

[1]  W. R. Dean.  On the Theory of Elastic Stability , 1925 .

[2]  Yong Wang,et al.  Combining Multiobjective Optimization With Differential Evolution to Solve Constrained Optimization Problems , 2012, IEEE Transactions on Evolutionary Computation.

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

[4]  Jürgen Branke,et al.  Experimental Analysis of Bound Handling Techniques in Particle Swarm Optimization , 2013, IEEE Transactions on Evolutionary Computation.

[5]  Jürgen Branke,et al.  Empirical comparison of MOPSO methods - Guide selection and diversity preservation - , 2009, 2009 IEEE Congress on Evolutionary Computation.

[6]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[7]  K. M. Ragsdell,et al.  Optimal Design of a Class of Welded Structures Using Geometric Programming , 1976 .

[8]  D. Goldsman.  Operations Research Models and Methods , 2003 .

[9]  Jonathan E. Fieldsend,et al.  A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts , 2005, EMO.

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

[11]  Yong Wang,et al.  A Dynamic Hybrid Framework for Constrained Evolutionary Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  J. Dixon,et al.  Engineering Design , 2019, Springer Handbook of Mechanical Engineering.

[13]  G. Zoutendijk,et al.  Methods of Feasible Directions , 1962, The Mathematical Gazette.

[14]  Wei Chu,et al.  Handling boundary constraints for particle swarm optimization in high-dimensional search space , 2011, Inf. Sci..

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

[16]  Rolf Wanka,et al.  Particle Swarm Optimization in High-Dimensional Bounded Search Spaces , 2007, 2007 IEEE Swarm Intelligence Symposium.

[17]  A. Ravindran,et al.  Engineering Optimization: Methods and Applications , 2006 .

[18]  Jaroslaw Arabas,et al.  Experimental Comparison of Methods to Handle Boundary Constraints in Differential Evolution , 2010, PPSN.

[19]  Kalyanmoy Deb,et al.  Optimization for Engineering Design: Algorithms and Examples , 2004 .

[20]  S. Timoshenko.  Theory of Elastic Stability , 1936 .

[21]  Amir Hossein Gandomi,et al.  Evolutionary boundary constraint handling scheme , 2012, Neural Computing and Applications.

[22]  Kalyanmoy Deb,et al.  Boundary Handling Approaches in Particle Swarm Optimization , 2012, BIC-TA.

[23]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[24]  Kalyanmoy Deb,et al.  A Bi-objective Based Hybrid Evolutionary-Classical Algorithm for Handling Equality Constraints , 2011, EMO.

[25]  Kalyanmoy Deb,et al.  Improving differential evolution through a unified approach , 2013, J. Glob. Optim..

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

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