Anytime 协作式隐式命中集求解
Anytime Cooperative Implicit Hitting Set Solving
AI总结:
针对隐式命中集方法在加权约束满足问题中的应用,本文提出结合上下界求解的多线程协同算法HS-lub,具备有效anytime特性,在基准测试中部分优于成熟的Toulbar2并行实现。
摘要:
隐式命中集(HS)方法已被证明在MaxSAT、伪布尔优化及其他布尔框架中非常有效。近期,该方法通过所谓的代价函数合并技术,在极为相似的加权约束满足问题(Weighted CSP)框架中也展现出潜力。HS方法的最初构想聚焦于获取不断提升的下界(HS-lb)。然而,正如伪布尔优化领域所展示的,该方法也可经调整用于计算不断提升的上界(HS-ub)。本文同时考量这两种HS方法,并展示如何在多线程架构中轻松将二者结合:任一组件发现的核心(core)均可被另一组件使用,有趣的是,这会在二者之间产生协同效应。我们证明,由此得到的算法HS-lub始终优于单独使用的HS-lb和HS-ub。最重要的是,HS-lub具备有效的anytime(随时可用)特性,在执行过程中可不断缩小最优性间隙。我们在Weighted CSP框架下测试了该方法,在三个不同基准上的结果显示,我们极为简单的实现有时性能甚至优于经过更充分开发的、当前最优的Toulbar2的并行混合最佳优先搜索实现。
英文摘要:
The Implicit Hitting Set (HS) approach has shown to be very effective for MaxSAT, Pseudo-boolean optimization and other boolean frameworks. Very recently, it has also shown its potential in the very similar Weighted CSP framework by means of the so-called cost-function merging. The original formulation of the HS approach focuses on obtaining increasingly better lower bounds (HS-lb). However, and as shown for Pseudo-Boolean Optimization, this approach can also be adapted to compute increasingly better upper bounds (HS-ub). In this paper we consider both HS approaches and show how they can be easily combined in a multithread architecture where cores discovered by either component are available by the other which, interestingly, generates synergy between them. We show that the resulting algorithm (HS-lub) is consistently superior to either HS-lb and HS-ub in isolation. Most importantly, HS-lub has an effective anytime behaviour with which the optimality gap is reduced during the execution. We tested our approach on the Weighted CSP framework and show on three different benchmarks that our very simple implementation sometimes outperforms the parallel hybrid best-first search implementation of the far more developed state-of-the-art Toulbar2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。