loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

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

ISBN: 978-989-8425-97-3

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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.224.108.85

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Macedo R., Hanafi S., Clautiaux F., Alves C. and M. Valério de Carvalho J. (2012). GENERALIZED DISAGGREGATION ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND MULTIPLE ROUTES.In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8425-97-3, pages 305-312. DOI: 10.5220/0003755003050312

@conference{icores12,
author={Rita Macedo and Saïd Hanafi and François Clautiaux and Cláudio Alves and J. M. Valé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 - Volume 1: ICORES,},
year={2012},
pages={305-312},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003755003050312},
isbn={978-989-8425-97-3},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - GENERALIZED DISAGGREGATION ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND MULTIPLE ROUTES
SN - 978-989-8425-97-3
AU - Macedo R.
AU - Hanafi S.
AU - Clautiaux F.
AU - Alves C.
AU - M. Valério de Carvalho J.
PY - 2012
SP - 305
EP - 312
DO - 10.5220/0003755003050312

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.