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

约束满足问题的自适应分支算法

Adaptive Branching for Constraint Satisfaction Problems

University of the Aegean(爱琴大学)

Thanasis Balafoutis, Kostas Stergiou

摘要:

CSP的两种标准分支方案是d路和2路分支。虽然已经表明,在理论上,后者可能比前者更有效,但缺乏经验证据表明这种差异。为了研究这一点,我们首先在广泛的基准上对两个分支方案进行了实验比较。实验结果验证了d路和2路分支之间的理论差距,因为我们从一个简单的变量排序启发式,如dom移动到更复杂的dom/ddeg。然而,也许令人惊讶的是,实验还表明,当使用最先进的变量排序算法(如dom/wdeg)时,在许多情况下,d路显然比2路分支更有效。出于这种观察,我们开发了两个通用的算法,可以应用在搜索过程中的某些点,以决定是否2路分支或限制版本的2路分支,这是接近d路分支,将遵循。这些算法的应用结果在一个自适应的分支方案。两个通用算法的实例化实验证实,搜索与自适应分支优于搜索与一个固定的分支计划在广泛的问题。

英文摘要:

The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former, there is a lack of empirical evidence showing such differences. To investigate this, we initially make an experimental comparison of the two branching schemes over a wide range of benchmarks. Experimental results verify the theoretical gap between d-way and 2-way branching as we move from a simple variable ordering heuristic like dom to more sophisticated ones like dom/ddeg. However, perhaps surprisingly, experiments also show that when state-of-the-art variable ordering heuristics like dom/wdeg are used then d-way can be clearly more efficient than 2-way branching in many cases. Motivated by this observation, we develop two generic heuristics that can be applied at certain points during search to decide whether 2-way branching or a restricted version of 2-way branching, which is close to d-way branching, will be followed. The application of these heuristics results in an adaptive branching scheme. Experiments with instantiations of the two generic heuristics confirm that search with adaptive branching outperforms search with a fixed branching scheme on a wide range of problems.

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

↑