1 citations · 1 across the 1 of their papers we have counts for
3 papers
A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Sahar Chehrazad, Dirk Roose, Tony Wauters
We present a fast algorithm to solve nesting problems based on a semi-discrete representation of both the 2D non-convex pieces and the strip. The pieces and the strip are represent…
Heuristics for vehicle routing problems: Sequence or set optimization?
Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer "assignment" and visits "sequencing" decision variables. W…
MILP and Max-Clique based heuristics for the Eternity II puzzle
Fabio Salassa, Wim Vancroonenburg, Tony Wauters +2
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer…