A relative feasibility degree based approach for constrained optimization problems

Based on the ratio of the size of the feasible region of constraints to the size of the feasible region of a constrained optimization problem, we propose a new constraint handling approach to improve the efficiency of heuristic search methods in solving the constrained optimization problems. In the traditional classification of a solution candidate, it is either a feasible or an infeasible solution. To refine this classification, a new concept about the relative feasibility degree of a solution candidate is proposed to represent the amount by which the ‘feasibility’ of the solution candidate exceeds that of another candidate. Relative feasibility degree based selection rules are also proposed to enable evolutionary computation techniques to accelerate the search process of reaching a feasible region. In addition, a relative feasibility degree based differential evolution algorithm is derived to solve constraint optimization problems. The proposed approach is tested with nine benchmark problems. Results indicate that our approach is very competitive compared with four existing state-of-the-art techniques, though still sensitive to the intervals of control parameters of the differential evolution.

[1]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[2]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[3]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[5]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

[7]  Yuren Zhou,et al.  An Adaptive Tradeoff Model for Constrained Evolutionary Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[8]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

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

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

[11]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[12]  Z. Michalewicz,et al.  Your brains and my beauty: parent matching for constrained optimisation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

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

[15]  Carlos A. Coello Coello,et al.  Simple Feasibility Rules and Differential Evolution for Constrained Optimization , 2004, MICAI.

[16]  R. Kowalczyk,et al.  Constraint consistent genetic algorithms , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[17]  Robert G. Reynolds,et al.  A Testbed for Solving Optimization Problems Using Cultural Algorithms , 1996, Evolutionary Programming.

[18]  Piero Mussio,et al.  Toward a Practice of Autonomous Systems , 1994 .

[19]  A. Kai Qin,et al.  Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

[21]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[22]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

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

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

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

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

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

[28]  Zbigniew Michalewicz,et al.  Test-case generator for nonlinear continuous parameter optimization techniques , 2000, IEEE Trans. Evol. Comput..

[29]  Marc Schoenauer,et al.  Constrained GA Optimization , 1993, ICGA.

[30]  Yong Wang,et al.  A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization , 2006, IEEE Transactions on Evolutionary Computation.

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