A matheuristic for the 2D bounded-size cutting stock problem
Alexis Robbes  1@  , Khadija Hadj Salem  2@  
1 : LIP6 - Laboratoire de recherche en informatique de Sorbonne Université
Sorbonne Université, CNRS, UMR 7606 LIP6, 4 place Jussieu, Paris Cedex 05, 75252, France
2 : LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
Mines Saint-Etienne, Univ Clermont Auvergne, CNRS, UMR 6158 LIMOS, Institut Henri Fayol, F - 42023 Saint-Etienne, France

We consider the two-dimensional Cutting Stock Problem (2D-CSP), where stocks of bounded sizes are available.
This variant is labeled as the two-dimensional Bounded-Size Cutting Stock Problem (2D-BSCSP).
It essentially consists of cutting a set of small rectangular items of given sizes from a set of rectangular larger plates with bounded height and width.
The generated cutting patterns are limited to two guillotine stages with trimming.
The main objective function is to minimize the total production.
The 2D-BSCSP is formulated as a strip-based mixed integer linear program and solved using a strip-based matheuristics, by considering strip selection and compatibilities computation procedures.
Computational experiments were performed on two sets of instances from the literature available at ~http://or.dei.unibo.it/library/2dpacklib.


Personnes connectées : 2 Vie privée
Chargement...