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...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 291; číslo 3; s. 883 - 893
Hlavní autori:	Libralesso, Luc, Fontan, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.06.2021
Predmet:	2018 ROADEF/EURO challenge Anytime tree search Cutting & packing Iterative Memory Bounded A Cutting & packing 2018 ROADEF/EURO challenge Anytime tree search Iterative Memory Bounded A
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!