3:50 PM - 4:10 PM
[3E2-01] A study on application of satisfaction method of constraints based on their difficulties in many constrained optimization problems
Keywords:multi-constrained optimization problem, stepwise satisfaction method of constraints, division of constraints
Due to the improvement of the performance of computers, GA is actively applied to actual engineering problems. Most of engineering problems are constrained optimization problems. Penalty method is well-known as the solution to such constrained optimization problems. The benchmarks of constrained optimization problems have only small number of constraints. Thus, the effectiveness of penalty method has not been investigated in many constrained problems. In many constrained optimization problems, penalty method has a risk that all constraints cannot be satisfied. This paper proposes the stepwise satisfaction method of constraints to satisfy many constraints. In the proposed method, the priority of constraints to be satisfied is defined based on the initial population. Furthermore, this paper studies on dividing constraints into difficult ones and easy ones and combining the proposed method with the penalty method. In the experiment, the performance of the proposed method and the penalty method was compared in two problems.