Inequality constraint handling in genetic algorithms using a boundary simulation method
Inequality constraint handling in genetic algorithms using a boundary simulation method
复制标题
DOI：
10.1016/j.cor.2011.03.019
复制
发表时间：
2012-03
期刊：
影响因子：
--
通讯作者：
Xiang Li;Gang Du
中科院分区：
文献类型：
--
作者：
Xiang Li;Gang Du
约束处理是应用遗传算法求解约束优化问题的主要问题之一。本文提出了一种边界模拟方法来解决遗传算法的不等式约束。该方法可以有效地生成可行域边界点集，近似地模拟可行域的边界。基于边界模拟法的结果，遗传算法可以直接从可行域的边界或可行域本身开始遗传搜索。此外，还提出了一系列的遗传算子，放弃或修复在搜索过程中产生的不可行的个人。数值实验表明，该方法可以提供竞争力的结果相比，其他研究。
Constraint handling is one of the major concerns when applying genetic algorithms (GAs) to solve constrained optimization problems. This paper proposes a boundary simulation method to address inequality constraints for GAs. This method can efficiently generate a feasible region boundary point set to approximately simulate the boundary of the feasible region. Based on the results of the boundary simulation method, GAs can start the genetic search from the boundary of the feasible region or the feasible region itself directly. Furthermore, a series of genetic operators that abandon or repair infeasible individuals produced during the search process is also proposed. The numerical experiments indicate that the proposed method can provide competitive results compared with other studies.