Authors:
Rita Macedo
1
;
Saïd Hanafi
1
;
François Clautiaux
2
;
Cláudio Alves
3
and
J. M. Valério de Carvalho
3
Affiliations:
1
Université de Valenciennes et du Hainaut-Cambrésis, France
;
2
Université des Sciences et Technologies de Lille, France
;
3
Universidade do Minho, Portugal
Keyword(s):
Integer programming, Combinatorial optimization, Vehicle Routing, Network flow model.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Mathematical Modeling
;
Methodologies and Technologies
;
Network Optimization
;
Operational Research
;
Optimization
;
OR in Transportation
;
Pattern Recognition
;
Routing
;
Software Engineering
;
Symbolic Systems
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 (Macedo et al., 2011). 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.