Arc-flow model for the two-dimensional cutting stock problem
Rita Macedo, Cláudio Alves, José Valério de Carvalho
Proceedings of the International Network Optimization Conference 2009 - INOC2009
Pisa, Italy, April 2009

ABSTRACT
In this paper, we address the VRP with multiple routes and time windows. For this variant of the VRP, there is a time interval within which every customer must be visited. In addition, every vehicle is allowed to perform more than one route within the same planning period. Here, we propose a general disaggregation algorithm that improves the exact approach described in a previous paper. We describe a novel rounding rule and a new node disaggregation scheme based on different discretization units. We describe a new integer programming model for the problem, which can be used, with a slight modification, to exactly assess whether a given solution is feasible or not. Finally, we report some computational experiments performed on a set of instances from the literature.

BIBTEX ENTRY
@inproceedings{MacedoHanafiClautiauxetalICORES12,
author = {Rita Macedo and Sa\"{\i}d Hanafi and Fran\c{c}ois Clautiaux and Cl{\'a}udio Alves and Jos{\'e} Val{\'e}rio de Carvalho},
title = {Arc-flow model for the two-dimensional cutting stock problem},
booktitle = {Proceedings of the International Network Optimization Conference 2009 - INOC2009},
address = {Vilamoura, Portugal},
year = {2009}}