.png){kind=icon}
返回
A self-organizing migrating genetic algorithm for constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.08.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a self-organizing migrating genetic algorithm for constrained optimization, called C-SOMGA is presented. This algorithm is based on the features of genetic algorithm (GA) and self-organizing migrating algorithm (SOMA). The aim of this work is to use a penalty free constraint handling selection with our earlier developed algorithm SOMGA (self-organizing migrating genetic algorithm) for unconstrained optimization. C-SOMGA is not only easy to implement but can also provide feasible and better solutions in less number of function evaluations. To evaluate the robustness of the proposed algorithm, its performance is reported on a set of ten constrained test problems taken from literature. To validate our claims, it is compared with C-GA (constrained GA), C-SOMA (constrained SOMA) and previously quoted results for these problems. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
genetic algorithms
self-organizing migrating algorithm
self-organizing migrating genetic algorithm
leader
active
path length
step size
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏
查看更多内容