.png){kind=icon}
返回
Comparing evolutionary algorithms on binary constraint satisfaction problems
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2003.816584.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constraint handling is not straightforward in evolutionary algorithms (EAs) since the usual search operators, mutation and recombination, are 'blind' to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade, numerous EAs for solving constraint satisfaction problems (CSP) have been introduced and studied on various problems. The diversity of approaches and the variety of problems used to study the resulting algorithms prevents a fair and accurate comparison of these algorithms. This paper aligns related work by presenting a concise overview and an extensive performance comparison of all these EAs on a systematically generated test suite of random binary CSPs. The random problem instance generator is based on a theoretical model that fixes deficiencies of models and respective generators that have been formerly used in the evolutionary computing field.
Keyword:
adaptivity
constraint satisfaction problems
evolutionary algorithms
heuristics
problem instance generator
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Pest Arthropods with Holocentric Chromosomes are More Resistant to Sterilizing Ionizing Radiation
PREAI
分享收藏分享收藏
查看更多内容