arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.0407cs.AI
收藏

CSP分支方案的实验评价

Experimental Evaluation of Branching Schemes for the CSP

University of the Aegean(爱琴海大学);University of Western Macedonia(西马其顿大学)

Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou

摘要:

CP求解器的搜索策略由它所采用的变量和值排序算法以及它所遵循的分支方案决定。虽然变量和值排序策略对搜索努力的影响已经得到了广泛的研究,不同的分支方案的影响受到较少的关注。在本文中,我们研究这种效果,通过实验评估,包括标准的分支计划,如2路,d-路,和二分域分裂,以及变化的集分支分支的分支值集上进行。我们还提出并评估了一个通用的方法来设置分支的分区域集创建使用的值排序启发式的值分配的分数,和聚类算法从机器学习。实验结果表明,虽然分支方案之间的指数差异,如理论上预测的2路和d路分支,是不是很常见,仍然分支方案的选择可以使某些类的问题有很大的不同。集合分支方法与双向分支方法非常有竞争力,并且在某些问题类上优于它。统计分析的结果表明,我们的通用聚类为基础的集分支方法是最好的方法比较。

英文摘要:

The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable and value ordering heuristics on search effort have been widely studied, the effects of different branching schemes have received less attention. In this paper we study this effect through an experimental evaluation that includes standard branching schemes such as 2-way, d-way, and dichotomic domain splitting, as well as variations of set branching where branching is performed on sets of values. We also propose and evaluate a generic approach to set branching where the partition of a domain into sets is created using the scores assigned to values by a value ordering heuristic, and a clustering algorithm from machine learning. Experimental results demonstrate that although exponential differences between branching schemes, as predicted in theory between 2-way and d-way branching, are not very common, still the choice of branching scheme can make quite a difference on certain classes of problems. Set branching methods are very competitive with 2-way branching and outperform it on some problem classes. A statistical analysis of the results reveals that our generic clustering-based set branching method is the best among the methods compared.

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

↑