arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.02205cs.AI
收藏

约束规划的相关启发式算法

Correlation Heuristics for Constraint Programming

School of Computing National University of Singapore(新加坡国立大学计算机学院)

Ruiwei Wang, Wei Xia, Roland H. C. Yap

摘要:

有效的通用搜索策略是约束编程中的一个重要组成部分。我们引入了一个新的想法,即使用变量之间的相关性来指导搜索。变量相关性的测量和维护使用域的变化在约束传播。我们提出了两个变量的相关矩阵,crbs-sum和crbs-max的基础上。我们评估我们的相关算法与众所周知的算法,即DOM/WDEG,基于影响的搜索和基于活动的搜索。在大量基准测试集上的实验表明,我们的相关算法与其他算法相比具有竞争力,并且在许多系列上都是最快的。

英文摘要:

Effective general-purpose search strategies are an important component in Constraint Programming. We introduce a new idea, namely, using correlations between variables to guide search. Variable correlations are measured and maintained by using domain changes during constraint propagation. We propose two variable heuristics based on the correlation matrix, crbs-sum and crbs-max. We evaluate our correlation heuristics with well known heuristics, namely, dom/wdeg, impact-based search and activity-based search. Experiments on a large set of benchmarks show that our correlation heuristics are competitive with the other heuristics, and can be the fastest on many series.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑