Pattern based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers

François Clautiaux 1, 2 Ruslan Sadykov 1 François Vanderbeck 1, 2 Quentin Viaud 2, 1
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : We consider a variant of two-dimensional guillotine cutting-stock problem that arises when different bills of order (or batches) are considered consecutively. The raw material leftover of the last cutting pattern is not counted as waste as it can be reused for cutting the next batch. The objective is thus to maximize the length of the leftover. We propose a diving heuristic based on a Dantzig-Wolfe reformulation solved by column generation in which the pricing problem is solved using dynamic programming (DP). This DP generates so-called non-proper columns, i.e. cutting patterns that cannot participate in a feasible integer solution of the problem. We show how to adapt the standard diving heuristic to this " non-proper " case while keeping its effectiveness. We also introduce the partial enumeration technique, which is designed to reduce the number of non-proper patterns in the solution space of the dynamic program. This technique helps to strengthen the lower bounds obtained by column generation and improve the quality of solutions found by the diving heuristic. Computational results are reported and compared on classical benchmarks from the literature as well as on new instances inspired from industrial data. According to these results, proposed diving algorithms outperform constructive and evolutionary heuristics.
Document type :
Journal articles
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Ruslan Sadykov <>
Submitted on : Tuesday, December 5, 2017 - 2:50:30 PM
Last modification on : Wednesday, July 10, 2019 - 1:21:32 AM


Files produced by the author(s)



François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud. Pattern based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO Journal on Computational Optimization, Springer, In press, pp.1-30. ⟨10.1007/s13675-019-00113-9⟩. ⟨hal-01656179⟩



Record views


Files downloads