Design Problems with Soft Linear Constraints
暂无分享,去创建一个
A broad class of design problems can be represented as a class of problems with linear constraints. Several approaches can be used to solve such problems. Unfortunately, most of them cannot process soft constraints which do not limit the solution space but introduce only a measure of acceptance for the space of possible solutions.
[1] Gunar E. Liepins,et al. Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.
[2] Zbigniew Michalewicz,et al. Handling Constraints in Genetic Algorithms , 1991, ICGA.