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.

中文翻译：

---

2018 ROADEF/EURO 挑战玻璃切割问题的任意树搜索算法

在本文中，我们展示了我们为法国圣戈班公司提出的 2018 ROADEF/EURO 挑战玻璃切割问题设计的随时树搜索算法。由此产生的计划在 64 名参与者中排名第一。它的关键组成部分是：一种名为 Memory Bounded A* (MBA*) 的新搜索算法，具有引导函数、对称破坏策略和伪优势规则。我们对这些组件进行了全面研究，表明它们中的每一个都有助于算法的全局性能。此外，我们完全基于伪优势规则设计了第二种树搜索算法，并专门针对一些具有强优先级约束的挑战实例。在这些情况下，它可以非常快速地找到最著名的解决方案。