An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
•Winner algorithm of the final phase of the 2018 ROADEF/EURO challenge.•New generic anytime tree search algorithm (Iterative Memory Bounded A*).•Combining heuristic guides, symmetry breaking, and pseudo-dominance rules.•Comprehensive study to assess components contribution.•Specialized dynamic progr...
Uložené v:
| Vydané v: | European journal of operational research Ročník 291; číslo 3; s. 883 - 893 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
16.06.2021
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | •Winner algorithm of the final phase of the 2018 ROADEF/EURO challenge.•New generic anytime tree search algorithm (Iterative Memory Bounded A*).•Combining heuristic guides, symmetry breaking, and pseudo-dominance rules.•Comprehensive study to assess components contribution.•Specialized dynamic programming algorithm for heavily constrained instances.
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 Iterative Memory Bounded A* (IMBA*) 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. |
|---|---|
| ISSN: | 0377-2217 1872-6860 |
| DOI: | 10.1016/j.ejor.2020.10.050 |