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

领域无关动态规划:面向组合优化的通用状态空间搜索

Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization

University of Toronto(多伦多大学)

Ryo Kuroiwa, J. Christopher Beck

AI总结:

本文提出领域无关动态规划 DIDP,通过 DyPDL 形式化定义 DP 模型,并借助通用状态空间搜索求解器 CAASDy,在多类组合优化问题上优于商用 MIP 与 CP 求解器。

摘要:

对于组合优化问题,混合整数规划(MIP)和约束规划(CP)等基于模型的方法旨在将问题的建模与求解解耦:这正是声明式问题求解的“圣杯”。我们提出领域无关动态规划(DIDP),这是一种基于动态规划(DP)的新型基于模型的范式。尽管 DP 并不新鲜,但它通常被实现为一种问题特定的方法。我们提出 Dynamic Programming Description Language(DyPDL,动态规划描述语言),一种用于定义 DP 模型的形式体系,并开发 Cost-Algebraic A* Solver for DyPDL(CAASDy),这是一个利用状态空间搜索的 DyPDL 通用求解器。我们将组合优化问题中现有的问题特定 DP 和状态空间搜索方法形式化为 DyPDL 中的 DP 模型。利用 CAASDy 以及商用 MIP 和 CP 求解器,我们通过实验将这些 DP 模型与现有 MIP 和 CP 模型进行比较,结果表明,尽管 CAASDy 仍处于初期阶段,但它在若干常见问题类别上的表现优于 MIP 和 CP。

英文摘要:

For combinatorial optimization problems, model-based approaches such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a problem: the 'holy grail' of declarative problem solving. We propose domain-independent dynamic programming (DIDP), a new model-based paradigm based on dynamic programming (DP). While DP is not new, it has typically been implemented as a problem-specific method. We propose Dynamic Programming Description Language (DyPDL), a formalism to define DP models, and develop Cost-Algebraic A* Solver for DyPDL (CAASDy), a generic solver for DyPDL using state space search. We formalize existing problem-specific DP and state space search methods for combinatorial optimization problems as DP models in DyPDL. Using CAASDy and commercial MIP and CP solvers, we experimentally compare the DP models with existing MIP and CP models, showing that, despite its nascent nature, CAASDy outperforms MIP and CP on a number of common problem classes.

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

↑