Multi-start Approach for Solving an Asymmetric Heterogeneous Vehicle Routing Problem in a Real Urban Context

José Cáceres-Cruz, Daniel Riera, Roman Buil, Angel A. Juan, Rosa Herrero

Abstract

Urban transportation is a strategic domain that has become an important issue for client satisfaction in distribution companies. In academic literature, this problem is categorized as a Vehicle Routing Problem, a popular research stream that has undergone significant theoretical advances but has remained far from practice implementations. Most Vehicle Routing Problems usually assume homogenous fleets, that is, all vehicles are considered of the same type and size. In reality, this is usually not the case as most companies use different types of trucks to distribute their products. Also, researchers consider symmetric distances between customers. However, in intra-urban distribution it is more appropriate to consider asymmetric costs. In this study, we address the Heterogeneous Fixed Fleet Vehicle Routing Problem with some additional constraints: (a) Asymmetric Cost matrix, (b) Service Times and (c) Routes Length restrictions. Our objective function is to reduce the total routing costs. We present an approach using a multi-start algorithm that combines a randomized Clarke & Wright’s Savings heuristic and a local search procedure. We execute our algorithm with data from a company that distributes food to more than 50 customers in Barcelona. The results reveal promising improvements when compared to an approximation of the company’s route planning.

References

  1. Baldacci, R., Battarra, M., Vigo, D. 2008. Routing a Heterogeneous Fleet of Vehicles. In The Vehicle Routing Problem: Latest Advances and New Challenges. B. Golden, S. Raghavan and E. E. Wasil, Springer: 3-27.
  2. Cáceres-Cruz, J., Lourenço, H., Juan, A., Grasas, A., Roca, M., Colome, R. 2012. Aplicación de un Algoritmo Híbrido para la Resolución de un Problema de Enrutamiento de Vehículos Heterogéneos en una Empresa de Distribución. In Proceddings of Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB), 767-773. February 8-10. Albacete, Spain.
  3. Clarke, G., Wright, J. 1964. Scheduling of vehicles from central depot to number of delivery points. Operations Research, 12(4):568-581.
  4. Dantzig, G. B., Ramser, J. H. 1959. The Truck Dispatching Problem. Management Science 6:80-91.
  5. Fischetti, M., Toth, P., Vigo, D. 1994. A branch-andbound algorithm for the capacitated vehicle-routing problem on directed-graphs. Operations Research 42(5):846-859.
  6. Juan, A. A., Faulín, J., Ruiz, R., Barrios, B., Caballe, S. 2010. The SR-GCWS Hybrid Algorithm for Solving the Capacitated Vehicle Routing Problem. Applied Soft Computing 10: 215-224.
  7. Juan, A. A., Faulin, J., Jorba, J., Riera, D., Masip; D., Barrios, B. 2011. On the Use of Monte Carlo Simulation, Cache and Splitting Techniques to Improve the Clarke and Wright Savings Heuristics. Journal of the Operational Research Society 62: 1085- 1097.
  8. Laporte, G., Mercure, H., Nobert, Y. 1986. An exact algorithm for the asymmetrical capacitated vehiclerouting problem. Networks 16(1): 33-46.
  9. Laporte, G. 2009. Fifty Years of Vehicle Routing. Transportation Science 43(4): 408-416.
  10. Li, F., Golden, B., Wasil, E. 2007. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers & Operations Research 34: 2734-42.
  11. Marmion, M. E., Humeau, J., Jourdan, L., Dhaenens, C. 2010. Comparison of neighborhoods for the HFFAVRP, Computer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on , pp.1-7, 16-19 May 2010.
  12. Pessoa, A., Poggi de Aragão, M., Uchoa, E. 2008. Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems. In The Vehicle Routing Problem: Latest Advances and New Challenges. B. Golden, S. Raghavan and E. E. Wasil, Springer: 297-325.
  13. Rodríguez, A., Ruiz, R. 2012. A study on the effect of the asymmetry on real capacitated vehicle routing problems. Computers & Operations Research 39(9): 2142-2151.
  14. Subramanian, A., Penna, P. H. V., Uchoa, E., Ochi, L. S. 2012. A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research 221: 285-295.
  15. Toth, P., Vigo, D., 1999. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research 113: 528-543.
  16. Vigo, D. 1996. A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem. European Journal of Operational Research 89: 108-126.
Download


Paper Citation


in Harvard Style

Cáceres-Cruz J., Riera D., Buil R., Juan A. and Herrero R. (2013). Multi-start Approach for Solving an Asymmetric Heterogeneous Vehicle Routing Problem in a Real Urban Context . In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8565-40-2, pages 168-174. DOI: 10.5220/0004209101680174


in Bibtex Style

@conference{icores13,
author={José Cáceres-Cruz and Daniel Riera and Roman Buil and Angel A. Juan and Rosa Herrero},
title={Multi-start Approach for Solving an Asymmetric Heterogeneous Vehicle Routing Problem in a Real Urban Context},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2013},
pages={168-174},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004209101680174},
isbn={978-989-8565-40-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Multi-start Approach for Solving an Asymmetric Heterogeneous Vehicle Routing Problem in a Real Urban Context
SN - 978-989-8565-40-2
AU - Cáceres-Cruz J.
AU - Riera D.
AU - Buil R.
AU - Juan A.
AU - Herrero R.
PY - 2013
SP - 168
EP - 174
DO - 10.5220/0004209101680174