用Memetic/Exact混合算法求解加权约束满足问题
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms
摘要:
加权约束满足问题(WCSP)是一种可以表达解之间偏好的约束满足问题。桶消元法是解决这类约束满足问题的一种常用的完整技术。当应用桶消除所需的存储器太高时,可以使用基于它的探试法(命名为迷你桶)来计算最优解的边界。然而,维数灾难使得这些技术在大规模问题上不切实际。针对这种情况,我们提出了一个模因算法WCSP桶消除作为一种机制,用于重组的解决方案,提供最好的可能的孩子从父母的集合。随后,一个多层次的模型中,这种精确/元启发式混合进一步杂交与分支定界技术和迷你桶进行了研究。作为一个案例研究,我们已经将这些算法的最大密度静物问题,一个硬约束优化问题的基础上康威游戏的生活的决议。由此产生的算法始终找到最佳模式,最新解决的情况下,在更短的时间比目前的方法。此外,它表明,该建议提供了新的最佳已知的解决方案非常大的情况下。
英文摘要:
A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory required to apply bucket elimination is too high, a heuristic method based on it (denominated mini-buckets) can be used to calculate bounds for the optimal solution. Nevertheless, the curse of dimensionality makes these techniques impractical on large scale problems. In response to this situation, we present a memetic algorithm for WCSPs in which bucket elimination is used as a mechanism for recombining solutions, providing the best possible child from the parental set. Subsequently, a multi-level model in which this exact/metaheuristic hybrid is further hybridized with branch-and-bound techniques and mini-buckets is studied. As a case study, we have applied these algorithms to the resolution of the maximum density still life problem, a hard constraint optimization problem based on Conways game of life. The resulting algorithm consistently finds optimal patterns for up to date solved instances in less time than current approaches. Moreover, it is shown that this proposal provides new best known solutions for very large instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。