.png){kind=icon}
返回
Multi-objective evolutionary search strategies in constraint programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.orp.2020.100177.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting techniques with a view to develop search strategies to classes of CSPs. A hierarchical scheme is employed to select a candidate strategy from the Pareto frontier for final evaluation. The results demonstrate that multi-objective optimisation significantly outperforms the single objective scheme in the same number of objective evaluations. In situations where strategies developed for a class of problems fail to extend to unseen problem instances of the same class, it is found that the structure of the underlying CSPs do not resemble those employed in the training process.
Keyword:
Combinatorial optimization
Multi-objective optimization
Genetic algorithms
Constraint programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
288
被引数:
951
机构
引用论文
.png){kind=icon}
分享收藏
Epidermal growth factor binding to cortical basolateral membranes in compensatory renal hypertrophy
PREAI
分享收藏 没有更多内容
没有更多内容