Vehicle Routing for Verde Azul Project Triple A

Authors

  • Diego Fernando Suero Pérez
  • Hugo Armando Caro Rivera
  • José Luis López Prado

DOI:

https://doi.org/10.18041/1909-2458/ingeniare.14.609

Keywords:

Vehicle routing and Logistics distribution, VRP

Abstract

Verde Azul project Triple A is a set of activities to recover from the source, recyclable material that will be duly processed and sold to companies for reuse. The problem to solve in this articles is to fi nd a set of delivery routes satisfying pick up requirements and giving minimal total cost. In practice, we are minimizing the total distance travelled from the scepter collection to customers

 

Downloads

References

K. Logozar, G. Radonjic, & M. Bastic, “Incorporation of reverse logistics model into in-plant recycling process: A case of aluminium industry. Resourser”, Conservation and Recycling, n°. 49, pp.

-67, 2006.

G. Laporte, “What You Should Know about the Vehicle Routing Problem”, Naval Research Logistics, n°. 8, pp. 811-819, 2007.

A. Lüer, M. Benavente, J. Bustos, & B. Venegas, El problema de rutas de vehículos: Extensiones y métodos de resolución, estado del arte. En U. d. Frontera (Ed.), Workshop Internacional EIG2009. Chile: Departamento de Ingeniería de Sistemas, 2009.

A. Fernández (23 de noviembre de 2012). Obtenido de Problema de enrutamiento de vehículos con recogida y entrega simultánea considerando una fl ota heterogénea. http://www.matcom.uh.cu/postgrd/Maestria_Matematica/serieInterna/OPAlina2010.pdf

D. Pisinger y S. Ropke (23 de noviembre de 2012). A general heuristic for vehicle routing problems. Obtenido de http://www.diku.dk/~sropke/Papers/GeneralVRP_TechRep.pdf

W. Winston, Investigación de operaciones, aplicaciones y algoritmos. México: Thomson, 2005.

V. Pillac, M. Gendreau, C. Guéret, y A. Medaglia, A review of dynamic vehicle routing problem. European Journal of Operational Research, 2012.

J. Renaud, y F. Boctor, A sweep-based algorithm for the fl eet size and mix. European Journal of Operational Research, 2001.

M. Daza, J. Montoya y F. Narducci, “Resolución del problema de enrutamiento de vehículos con limitaciones de capacidad utilizando un procedimiento Metaheurístico de dos fases”, Revista EIA,

J. Kirk (23 de noviembre de 2012). Traveling Salesman Problem - Genetic Algorithm. Obtenido de MATLAB CENTRAL. http://www.mathworks.com/matlabcentral/fi leexchange/13680-travelingsalesman-problem-genetic-algorithm

Downloads

Published

2013-01-01

Issue

Section

Artículos

How to Cite

1.
Suero Pérez DF, Caro Rivera HA, López Prado JL. Vehicle Routing for Verde Azul Project Triple A. ingeniare [Internet]. 2013 Jan. 1 [cited 2025 Apr. 7];(14):13-29. Available from: https://revistas.unilibre.edu.co/index.php/ingeniare/article/view/609

Similar Articles

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)