论文标题
Anytime Tree搜索算法2018 ROADEF/EURO挑战玻璃切割问题
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
论文作者
论文摘要
在本文中，我们介绍了我们为法国公司Saint-Gobain提出的2018年Roadef/euro挑战玻璃切割问题设计的任何时间树搜索算法。最终的计划在64名参与者中排名第一。它的关键组成部分是：一种称为内存的新搜索算法，具有指南功能，对称性破坏策略和伪优势规则。我们对这些组件进行了全面的研究，表明它们每个组件都有助于算法全球性能。此外，我们根据伪优势规则完全设计了第二种树搜索算法，并致力于具有强大优先限制的某些挑战实例。在这些情况下，它很快发现了最著名的解决方案。
In this article, we present the anytime tree search algorithm we designed for the 2018 ROADEF/EURO challenge glass cutting problem proposed by the French company Saint-Gobain. The resulting program was ranked first among 64 participants. Its key components are: a new search algorithm called Memory Bounded A* (MBA*) with guide functions, a symmetry breaking strategy, and a pseudo-dominance rule. We perform a comprehensive study of these components showing that each of them contributes to the algorithm global performances. In addition, we designed a second tree search algorithm fully based on the pseudo-dominance rule and dedicated to some of the challenge instances with strong precedence constraints. On these instances, it finds the best-known solutions very quickly.
