벌칙함수 기반 크리깅메타모델의 순차적 유용영역 실험계획

초록

Metamodel, model of model, has been widely used to improve an efficiency of optimization process in engineering fields. However, global metamodels of constraints in a constrained optimization problem are required good accuracy around neighborhood of optimum point. To satisfy this requirement, more sampling points must be located around the boundary and inside of feasible region. Therefore, a new sampling strategy that is capable of identifying feasible domain should be applied to select sampling points for metamodels of constraints. In this research, we suggeste sequential feasible domain sampling that can locate sampling points likely within feasible domain by using penalty function method. To validate the excellence of feasible domain sampling, we compare the optimum results from the proposed method with those form conventional global space-filling sampling for a variety of optimization problems. The advantages of the feasible domain sampling are discussed further.

키워드