CLAUTIAUX, François; SADYKOV, Ruslan; VANDERBECK, François; VIAUD, Quentin

doi:10.1007/s13675-019-00113-9

Métadonnées

Licence d’utilisation du document

CLAUTIAUX, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Université de Bordeaux [UB]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]

VANDERBECK, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Université de Bordeaux [UB]

Langue

Article de revue

Ce document a été publié dans

EURO Journal on Computational Optimization. 2019-09, vol. 7, n° 3, p. 265–297

Springer

Résumé en anglais

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.< Réduire

Mots clés en anglais

Cutting and Packing

Diving Heuristic

Dynamic Programming

Métadonnées

Partager cette publication !

Licence d’utilisation du document

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

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche