.png){kind=icon}
返回
Inequality constraint handling in genetic algorithms using a boundary simulation method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.03.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Genetic algorithms
Constrained optimization
Constraint handling
Inequality constraints
Equality constraints
Boundary simulation method
Binary search method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏The second generation of self-organizing adaptive penalty strategy for constrained genetic search
PREAI
分享收藏
查看更多内容