Differential Evolution with Adaptive Penalty and Tournament Selection for Optimization Including Linear Equality Constraints

In order to solve constrained optimization problems, meta-heuristics have to be equipped with a constraint handling scheme. Despite the generality of the meta-heuristics, a large number of objective function (and constraints) evaluations are required so that good results are found. To improve the performance of meta-heuristics it is useful to combine them with exact methods. In this paper, two differential evolution (DE) techniques are proposed to exactly satisfy the linear equality constraints present in a continuous optimization problem that may also include additional non-linear equality and/or inequality constraints. An adaptive penalty method (APM) and a tournament selection technique (TS) are combined to a previous DE variant, called DELEqC-II, to handle the non-linear equality and inequality constraints. Numerical experiments, which include test-problems from the literature, are performed in order to comparatively evaluate the new approaches. The results indicate that the proposed methods outperform the other techniques used in the comparisons.

[1]  Andries Petrus Engelbrecht,et al.  Particle Swarms for Linearly Constrained Optimisation , 2007, Fundam. Informaticae.

[2]  Carlos A. Coello Coello,et al.  Constraint-handling in nature-inspired numerical optimization: Past, present and future , 2011, Swarm Evol. Comput..

[3]  Kalyanmoy Deb,et al.  Evolutionary Constrained Optimization , 2014 .

[4]  Helio J. C. Barbosa,et al.  A new adaptive penalty scheme for genetic algorithms , 2003, Inf. Sci..

[5]  Andries Petrus Engelbrecht,et al.  A new particle swarm optimiser for linearly constrained optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[7]  Heder S. Bernardino,et al.  An improved differential evolution algorithm for optimization including linear equality constraints , 2018, Memetic Comput..

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

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

[10]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

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

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

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

[14]  Abu S. S. M. Barkat Ullah,et al.  Handling equality constraints in evolutionary optimization , 2012, Eur. J. Oper. Res..

[15]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

[16]  Kevin D. Seppi,et al.  Linear equality constraints and homomorphous mappings in PSO , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .