Download PDFOpen PDF in browser Switch back to the title and the abstract in French Why Branch-and-Bounds Are Meta-HeuristicsEasyChair Preprint no. 26472 pages•Date: February 12, 2020AbstractWe present a branch-and-bound family called "anytime" which is usually found in AI/planning. One of its member well-known in OR is Beam Search. Such algorithms are able to find good solutions fast and then try to improve them if possible. This approach is similar to classical meta-heuristics, but anytime branch-and-bounds happen to be more efficient in some cases. We present here two of these cases: cutting & packing problems and an asymmetrical TSP with precedence constraints. Keyphrases: Challenge EURO/ROADEF 2018, framework générique, Meta-heuristiques, Recherches Arborescentes, sequential ordering problem
|