Comparing evolutionary algorithms on binary constraint satisfaction problems

摘要: Constraint handling is not straightforward in evolutionary algorithms (EAs) since the usual search operators, mutation and recombination, are 'blind' to constraints. Nevertheless, issue highly relevant, for many challenging problems involve Over last decade, numerous EAs solving constraint satisfaction (CSP) have been introduced studied on various problems. The diversity of approaches variety used study resulting prevents a fair accurate comparison these algorithms. This paper aligns related work by presenting concise overview an extensive performance all systematically generated test suite random binary CSPs. problem instance generator based theoretical model that fixes deficiencies models respective generators formerly computing field.