A Genetic Algorithm Based Augmented Lagrangian Method for Computationally Fast Constrained Optimization

Among the penalty based approaches for constrained optimization, Augmented Lagrangian (AL) methods are better in at least three ways: (i) they have theoretical convergence properties, (ii) they distort the original objective function minimally to allow a better search behavior, and (iii) they can find the optimal Lagrange multiplier for each constraint as a by-product of optimization. Instead of keeping a constant penalty parameter throughout the optimization process, these algorithms update the parameters adaptively so that the corresponding penalized function dynamically changes its optimum from the unconstrained minimum point to the constrained minimum point with iterations. However, the flip side of these algorithms is that the overall algorithm is a serial implementation of a number of optimization tasks, a process that is usually time-consuming. In this paper, we devise a genetic algorithm based parameter update strategy to a particular AL method. The strategy is self-adaptive in order to make the overall genetic algorithm based augmented Lagrangian (GAAL) method parameter-free. The GAAL method is applied to a number of constrained test problems taken from the EA literature. The function evaluations required by GAAL in many problems is an order or more lower than existing methods.

[1]  Tetsuyuki Takahama,et al.  Solving Difficult Constrained Optimization Problems by the ε Constrained Differential Evolution with Gradient-Based Mutation , 2009 .

[2]  Yuren Zhou,et al.  Multi-objective and MGG evolutionary algorithm for constrained optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3]  Kalyanmoy Deb,et al.  A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach , 2010, IEEE Congress on Evolutionary Computation.

[4]  C. Coello.  TREATING CONSTRAINTS AS OBJECTIVES FOR SINGLE-OBJECTIVE EVOLUTIONARY OPTIMIZATION , 2000 .

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

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

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

[8]  Angel Eduardo Muñoz Zavala,et al.  Continuous Constrained Optimization with Dynamic Tolerance Using the COPSO Algorithm , 2009 .

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

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

[11]  Janez Brest,et al.  Constrained Real-Parameter Optimization with ε -Self-Adaptive Differential Evolution , 2009 .