Summary
International Symposium on Nonlinear Theory and Its Applications
2016
Session Number:B2L-F
Session:
Number:B2L-F-1
A Study on Satisfaction Method of Constraints by Approximating Constraints
Ryo Ooe, Tomohiro Yoshikawa,
pp.-
Publication Date:2016/11/27
Online ISSN:2188-5079
Summary:
Recently, Genetic Algorithm (GA) is actively applied to engineering problems. Most of these problems in the real world have many constraints and it is difficult to find the solutions which satisfy all constraints. In this paper, the satisfaction method of constraints by approximating the constraints is proposed. In this method, the difficulty of constraints are defined by obtained individuals and constraints are divided into easy ones and difficult ones. First, easy constraints are satisfied by minimizing violation amount of constraints. Then difficult constraints are efficiently satisfied by approximating them based on the information of evaluated individuals.