Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes
Rita Macedo, Said Hanafi, François Clautiaux, Cláudio Alves, José Valério de Carvalho
Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - ICORES 2012
Vilamoura, Portugal, February 2012

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 = {Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes},
booktitle = {Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - ICORES 2012},
address = {Vilamoura, Portugal},
year = {2012}}