A new constraint handling method based on the modified Alopex-based evolutionary algorithm

Abstract In this paper, a new constraint handling method based on a modified AEA (Alopex-based evolutionary algorithm) is proposed. Combined with a new proposed ranking and selecting strategy, the algorithm gradually converges to a feasible region from a relatively feasible region. By introduction of an adaptive relaxation parameter μ , the algorithm fully takes into account different functions corresponding to different sizes of feasible region. In addition, an adaptive penalty function method is employed, which adaptively adjust the penalty coefficient so as to guarantee a moderate penalty. By solving 11 benchmark test functions and two engineering problems, experiment results indicate that the proposed method is reliable and efficient for solving constrained optimization problems. Also, it has great potential in handling many engineering problems with constraints, even with equations.

[1]  Helio J. C. Barbosa,et al.  An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization , 2011 .

[2]  Yuan Xi-Gang,et al.  An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints , 2007 .

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

[4]  Haibo Zhang,et al.  An efficient constraint handling method with integrated differential evolution for numerical and engineering optimization , 2012, Comput. Chem. Eng..

[5]  Ling Wang,et al.  An effective co-evolutionary particle swarm optimization for constrained engineering design problems , 2007, Eng. Appl. Artif. Intell..

[6]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

[8]  Simon Haykin,et al.  Stochastic correlative learning algorithms , 2004, IEEE Transactions on Signal Processing.

[9]  Jasbir S. Arora,et al.  Introduction to Optimum Design , 1988 .

[10]  Dimitrios Syndoukas,et al.  A heuristically enhanced gradient approximation (HEGA) algorithm for training neural networks , 2010, Neurocomputing.

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

[12]  Quan Yuan,et al.  A hybrid genetic algorithm for twice continuously differentiable NLP problems , 2010, Comput. Chem. Eng..

[13]  Tetsuyuki Takahama,et al.  Efficient constrained optimization by the ε constrained adaptive differential evolution , 2010, IEEE Congress on Evolutionary Computation.

[14]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[15]  K. P. Unnikrishnan,et al.  Alopex: A Correlation-Based Learning Algorithm for Feedforward and Recurrent Neural Networks , 1994, Neural Computation.

[16]  Ling Wang,et al.  A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization , 2007, Appl. Math. Comput..

[17]  Pedro Larrañaga,et al.  Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions , 2002, Int. J. Approx. Reason..

[18]  C. Floudas,et al.  Global optimum search for nonconvex NLP and MINLP problems , 1989 .

[19]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[20]  Xigang Yuan,et al.  An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints , 2007, Computers and Chemical Engineering.

[21]  Erwie Zahara,et al.  Hybrid Nelder-Mead simplex search and particle swarm optimization for constrained engineering design problems , 2009, Expert Syst. Appl..

[22]  J. H. Zar,et al.  Biostatistical Analysis (5th Edition) , 1984 .

[23]  N. Stander,et al.  A dynamic penalty function method for the solution of structural optimization problems , 1994 .

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

[25]  Carlos A. Coello Coello,et al.  Boundary Search for Constrained Numerical Optimization Problems With an Algorithm Inspired by the Ant Colony Metaphor , 2009, IEEE Transactions on Evolutionary Computation.

[26]  Qingfu Zhang,et al.  DE/EDA: A new evolutionary algorithm for global optimization , 2005, Inf. Sci..

[27]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[28]  Fei Li,et al.  A Hybrid Evolutionary Algorithm Based on Alopex and Estimation of Distribution Algorithm and Its Application for Optimization , 2010, ICSI.

[29]  G. P. Rangaiah,et al.  Differential Evolution with Tabu List for Solving Nonlinear and Mixed-Integer Nonlinear Programming Problems , 2007 .

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

[31]  Fei Li,et al.  Alopex-based evolutionary algorithm and its application to reaction kinetic parameter estimation , 2011, Comput. Ind. Eng..

[32]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[33]  Ignacio E. Grossmann,et al.  Global optimization of nonconvex MINLP problems in process synthesis , 1987 .

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

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

[36]  Yong Wang,et al.  Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization , 2010, Appl. Soft Comput..

[37]  E Harth,et al.  Alopex: a stochastic method for determining visual receptive fields. , 1974, Vision research.

[38]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[39]  Chellapilla Patvardhan,et al.  A novel hybrid constraint handling technique for evolutionary optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[40]  Heinz Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions II. Continuous Parameters , 1996, PPSN.

[41]  Helio J. C. Barbosa,et al.  A genetic algorithm encoding for a class of cardinality constraints , 2005, GECCO '05.