An effective hybrid genetic algorithm with flexible allowance technique for constrained engineering design optimization

In this paper, a hybrid genetic algorithm with flexible allowance technique (GAFAT) is proposed for solving constrained engineering design optimization problems by fusing center based differential crossover (CBDX), Levenberg-Marquardt mutation (LMM) and non-uniform mutation (NUM). Inheriting the merits of mutation of differential evolution (DE), the proposed CBDX is a multi-parent recombination operator for generating offspring based on a parent vector and two parent center vectors. As an improvement of the gradient-based mutation, the proposed LMM is more numerically stable when enhancing the feasibility of the new individuals. To enrich the population diversity, NUM is incorporated into the hybrid algorithm. In addition, a flexible allowance technique (FAT) is designed and used in the hybrid algorithm to balance the selection of bad feasible solutions and good infeasible solutions. The proposed GAFAT is first tested based on the 13 widely used benchmark functions, which shows that GAFAT is of better or competitive performances when compared with six existing algorithms. The, GAFAT is applied to solve six well-known constrained engineering design problems, which also shows that GAFAT is of superior searching quality with fewer evaluation times than other algorithms. Finally, GAFAT is successfully applied to solve a real pipe frequency improvement problem.

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

[2]  Tetsuyuki Takahama,et al.  Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations , 2005, IEEE Transactions on Evolutionary Computation.

[3]  Anthony Chen,et al.  Constraint handling in genetic algorithms using a gradient-based repair method , 2006, Comput. Oper. Res..

[4]  Carlos A. Coello Coello,et al.  Modified Differential Evolution for Constrained Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[5]  Wenjian Luo,et al.  Differential evolution with dynamic stochastic selection for constrained optimization , 2008, Inf. Sci..

[6]  Aravind Srinivasan,et al.  A Population-Based, Parent Centric Procedure for Constrained Real-Parameter Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[7]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[8]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[9]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[10]  Lawrence Davis,et al.  Using a genetic algorithm to optimize problems with feasibility constraints , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .

[12]  Ling Wang,et al.  An effective differential evolution with level comparison for constrained engineering design , 2010 .

[13]  Xin Yao,et al.  Search biases in constrained evolutionary optimization , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[14]  C. Coello,et al.  Cultured differential evolution for constrained optimization , 2006 .

[15]  D. Marquardt An Algorithm for Least-Squares Estimation of Nonlinear Parameters , 1963 .

[16]  Jing J. Liang,et al.  Dynamic Multi-Swarm Particle Swarm Optimizer with a Novel Constraint-Handling Mechanism , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[18]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

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

[20]  Ling Wang,et al.  An effective co-evolutionary differential evolution for constrained optimization , 2007, Appl. Math. Comput..

[21]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

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

[23]  Kusum Deep,et al.  Optimal coordination of over-current relays using modified differential evolution algorithms , 2010, Eng. Appl. Artif. Intell..

[24]  C.-Y. Lin,et al.  Self-organizing adaptive penalty strategy in constrained genetic search , 2004 .

[25]  Tapabrata Ray,et al.  Society and civilization: An optimization algorithm based on the simulation of social behavior , 2003, IEEE Trans. Evol. Comput..

[26]  Ricardo Landa Becerra,et al.  Efficient evolutionary optimization through the use of a cultural algorithm , 2004 .

[27]  R. Haftka,et al.  Constrained particle swarm optimization using a bi-objective formulation , 2009 .

[28]  Jinhua Wang,et al.  A ranking selection-based particle swarm optimizer for engineering design optimization problems , 2008 .

[29]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

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

[31]  Zhun Fan,et al.  Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique , 2009 .

[32]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

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

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

[35]  S. Puzzi,et al.  A double-multiplicative dynamic penalty approach for constrained evolutionary optimization , 2008 .