Solving the assortment and trim loss
minimization problem using branch-and-price-and-cut
Cláudio Alves, José Valério de
Carvalho
Proceedings of the ORP3
2007 Conference - Operation Research Peripatetic Postgraduate Programme
Guimarães, Portugal, September 2007
ABSTRACT
In this paper, we address the combined assortment
and trim loss minimization problem. In real
settings, when different stock lengths are available, a
common problem is to select a subset of stock lengths
from which to cut the ordered items. In the cutting
and packing literature, this problem is known as the
assortment problem. Solving the assortment and trim loss
minimization problem in a single stage yields better cutting
plans since one takes into account the whole set of stock
lengths while computing the best set of cutting patterns.
Here, we present an exact branch-and-price-and-cut
algorithm to solve both the assortment and the trim
loss minimization problem in a single stage. We use an
integrated Integer Linear Programming model to compute
lower bounds at the nodes of the branch-and-bound tree,
and we derive a robust branching scheme to find the
integer optimal solution. We report on an extensive set
of computational experiments for random instances.
BIBTEX ENTRY
@inproceedings{AlvesCarvalhoORP3,
author = {Cl{\'a}udio Alves and Jos{\'e} Val{\'e}rio de Carvalho},
title = {Solving the assortment and trim loss
minimization problem using branch-and-price-and-cut},
booktitle = {Proceedings of the ORP3
2007 Conference - Operation Research Peripatetic Postgraduate Programme},
address = {Guimar{\~a}es, Portugal},
year = {2007}}