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

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.