A line up evolutionary algorithm for solving nonlinear constrained optimization problems

In this work a complete framework is presented for solving nonlinear constrained optimization problems, based on the line-up differential evolution (LUDE) algorithm which is proposed for solving unconstrained problems. Linear and/or nonlinear constraints are handled by embodying them in an augmented Lagrangian function, where the penalty parameters and multipliers are adapted as the execution of the algorithm proceeds. The LUDE algorithm maintains a population of solutions, which is continuously improved as it thrives from generation to generation. In each generation the solutions are lined up according to the corresponding objective function values. The position's in the line are very important, since they determine to what extent the crossover and the mutation operators are applied to each particular solution. The efficiency of the proposed methodology is illustrated by solving numerous unconstrained and constrained optimization problems and comparing it with other optimization techniques that can be found in the literature.

[1]  Rainer Storn,et al.  Minimizing the real functions of the ICEC'96 contest by differential evolution , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[3]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

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

[5]  Feng-Sheng Wang,et al.  Hybrid method of evolutionary algorithms for static and dynamic optimization problems with application to a fed-batch fermentation process , 1999 .

[6]  Jiafu Tang,et al.  Extension of a hybrid Genetic Algorithm for nonlinear programming problems with equality and inequality constraints , 2002, Comput. Oper. Res..

[7]  David W. Coit,et al.  Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems , 1996, INFORMS J. Comput..

[8]  Min-Jea Tahk,et al.  Coevolutionary augmented Lagrangian methods for constrained optimization , 2000, IEEE Trans. Evol. Comput..

[9]  Michael C. Ferris,et al.  Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem , 1994, INFORMS J. Comput..

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

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

[12]  Feng-Sheng Wang,et al.  Hybrid differential evolution with multiplier updating method for nonlinear constrained optimization problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  Hyun Myung,et al.  Evolutionary programming techniques for constrained optimization problems , 1997, IEEE Trans. Evol. Comput..

[14]  Jiafu Tang,et al.  A Hybrid Genetic Algorithm for a Type of Nonlinear Programming Problem , 1998 .

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

[16]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[19]  Bruce E. Rosen,et al.  Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

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