Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations

Constrained optimization problems are very important and frequently appear in the real world. The /spl alpha/ constrained method is a new transformation method for constrained optimization. In this method, a satisfaction level for the constraints is introduced, which indicates how well a search point satisfies the constraints. The /spl alpha/ level comparison, which compares search points based on their level of satisfaction of the constraints, is also introduced. The /spl alpha/ constrained method can convert an algorithm for unconstrained problems into an algorithm for constrained problems by replacing ordinary comparisons with the /spl alpha/ level comparisons. In this paper, we introduce some improvements including mutations to the nonlinear simplex method to search around the boundary of the feasible region and to control the convergence speed of the method, we apply the /spl alpha/ constrained method and we propose the improved /spl alpha/ constrained simplex method for constrained optimization problems. The effectiveness of the /spl alpha/ constrained simplex method is shown by comparing its performance with that of the stochastic ranking method on various constrained problems.

[1]  T. Takahama,et al.  Constrained Optimization by α Constrained Genetic Algorithm (αGA) , 2003 .

[2]  Tetsuyuki Takahama,et al.  Tuning fuzzy control rules by the ? constrained method which solves constrained nonlinear optimization problems , 2000 .

[3]  T. Takahama,et al.  Learning fuzzy control rules by a constrained Powell's method , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[4]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[5]  N. R. Chapman,et al.  A hybrid simplex genetic algorithm for estimating geoacoustic parameters using matched-field inversion , 1999 .

[6]  Tapabrata Ray,et al.  An intelligent information sharing strategy within a swarm for unconstrained and constrained optimization problems , 2002, Soft Comput..

[7]  Robert G. Reynolds,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

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

[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]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[11]  Carlos A. Coello Coello,et al.  Handling constraints using multiobjective optimization concepts , 2004 .

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

[13]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

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

[15]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[16]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[17]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

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

[19]  Vassilios Petridis,et al.  Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of the Dynamic Penalty Terms , 1998, PPSN.

[20]  John Yen,et al.  A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[21]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[22]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

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

[24]  X. Yao,et al.  Evolutionary search and constraint violations , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[26]  Keigo Watanabe,et al.  Evolutionary Optimization of Constrained Problems , 2004 .

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

[28]  Abdelhay A. Sallam,et al.  Swarming of intelligent particles for solving the nonlinear constrained optimization problem , 2001 .

[29]  John Yen,et al.  A simplex genetic algorithm hybrid , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[30]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[31]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[32]  Zbigniew Michalewicz,et al.  Evolutionary optimization of constrained problems , 1994 .

[33]  Tetsuyuki Takahama,et al.  Learning fuzzy control rules by alpha-constrained Simplex method , 2003, Systems and Computers in Japan.