The paper presents a new cutting stock problem formulation that considers sequence dependent cut losses between items. It is shown that the problem formulation is strongly related to the distance constrained vehicle routing problem, and that the formulation reduces to the bin packing problem under specific conditions. A computational study will be presented at the conference that investigates the relevance of considering such sequence dependent cut losses. To this end, classic bin packing and vehicle routing heuristics, as well as a tailored pattern based heuristic based on an exact set covering formulation, are compared on a set of instances with varying characteristics.

A computational study of a cutting stock problem with sequence dependent cut losses / Garraffa, Michele; Salassa, FABIO GUIDO MARIO; Vancroonenburg, W.; Vanden Berghe, G.; Wauters, T.. - (2013), pp. 703-706. ((Intervento presentato al convegno Multidisciplinary International Scheduling conference: Theory & Applications (MISTA2013) tenutosi a Ghent nel 27-30 August 2013.

A computational study of a cutting stock problem with sequence dependent cut losses

GARRAFFA, MICHELE;SALASSA, FABIO GUIDO MARIO;
2013

Abstract

The paper presents a new cutting stock problem formulation that considers sequence dependent cut losses between items. It is shown that the problem formulation is strongly related to the distance constrained vehicle routing problem, and that the formulation reduces to the bin packing problem under specific conditions. A computational study will be presented at the conference that investigates the relevance of considering such sequence dependent cut losses. To this end, classic bin packing and vehicle routing heuristics, as well as a tailored pattern based heuristic based on an exact set covering formulation, are compared on a set of instances with varying characteristics.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2525118
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo