GENERALIZED DISAGGREGATION ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND MULTIPLE ROUTES

Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, J. M. Valério de Carvalho

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 (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.

References

  1. Azi, N., Gendreau, M., and Potvin, J.-Y. (2010). An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research, 202(3):756 - 763.
  2. Baldacci, R., Christofides, N., and Mingozzi, A. (2008). An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming, 115(2):351- 385.
  3. Baldacci, R., Toth, P., and Vigo, D. (2010). Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research, 175(1):213-245.
  4. Cordeau, J.-F., Laporte, G., Savelsbergh, M., and Vigo, D. Vehicle routing. In Barnhart, C. and Laporte, G., editors, Transportation, Handbooks in Operations Research and Management Science, volume 14. Elsevier, Amsterdam.
  5. Dantzig, G. and Ramser, J. (1959). The truck dispatching problem. Management Science, 6(1):80-91.
  6. Feillet, D., Dejax, P., Gendreau, M., and Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 44:216- 229.
  7. Fukasawa, R., Longo, H., Lysgaard, J., de Araga˜o, M. P., Reis, M., Uchoa, E., and Werneck, R. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, 106(3):491-511.
  8. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4):408-416.
  9. Lysgaard, J., Letchford, A., and Eglese, R. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2):423-445.
  10. Macedo, R., Alves, C., Valério de Carvalho, J., Clautiaux, F., and Hanafi, S. (2011). Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research, 214(3):536 -545.
  11. Toth, P. and Vigo, D. (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
Download


Paper Citation


in Harvard Style

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


in Bibtex Style

@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},
}


in EndNote Style

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