A vehicle routing application for retail delivery with open source tools

dc.contributor.advisorRomero Gelvez, Jorge Ivan
dc.coverage.spatialColombiaspa
dc.creatorGarzon Castro, Karina Andrea
dc.creatorMondragón García, Sebastián
dc.date.accessioned2020-02-13T19:24:05Z
dc.date.available2020-02-13T19:24:05Z
dc.date.created2020
dc.description.abstractEste trabajo muestra la aplicación del Problema de enrutamiento de vehículos capacitados con ventanas de tiempo (CVRPTW) para recopilar diferentes demandas de carga en varios lugares con poca disponibilidad de tiempo para atender cualquier vehículo. El objetivo del modelo es reducir el tiempo de ruta en un problema con una flota mixta de vehículos. El paso inicial es la creación de una matriz de distancia utilizando la API de Google Maps, luego las capacidades de carga para cada vehículo y las ventanas de tiempo para cada punto de demanda se incluyen en el modelo. El problema se resuelve con las herramientas de Google-OR utilizando como algoritmo aproximado de primera solución y como segundo algoritmo metaheurístico de solución para búsqueda local.spa
dc.description.abstractenglishThis work shows the application of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) to collect di erent cargo-demand in several locations with low time disponibility to attend any vehicle. The objective of the model is to reduce the routing time in a problem with mixed vehicle- eet. The initial step is the creation of a distance matrix by using the Google Maps API, then cargo capacities for every vehicle and time-windows for every demand point are included in the model. The problem is solved with Google-OR tools using as rt solution aproximated algoritm and as second solution one metaheuristic algorithm for local search.spa
dc.description.degreenameIngeniero industrialspa
dc.description.rdaRequerimientos de sistema: Adobe Acrobat Readerspa
dc.format.extent12 páginasspa
dc.format.mimetypeapplication/pdfspa
dc.format.rda1 recurso en línea (archivo de texto)spa
dc.identifier.instnameinstname:Universidad de Bogotá Jorge Tadeo Lozanospa
dc.identifier.reponamereponame:Repositorio Institucional de la Universidad de Bogotá Jorge Tadeo Lozanospa
dc.identifier.repourlhttp://expeditio.utadeo.edu.cospa
dc.identifier.urihttps://hdl.handle.net/20.500.12010/7429
dc.publisherUniversidad de Bogotá Jorge Tadeo Lozanospa
dc.publisher.facultyFacultad de Ciencias Naturales e Ingenieríaspa
dc.publisher.programIngeniería Industrialspa
dc.relation.referencesClients map - google's maps api, https://drive.google.com/open?id=1 MxV75hs qlFENsXIhh0HJDYZkcu7pJ-&usp=sharingspa
dc.relation.referencesGoogle's or-tools, https://developers.google.com/optimization/spa
dc.relation.referencesArenas, I.G.P., S anchez, A.G., Armando, C., Solano, L., Medina, L.B.R.: Cvrptw model applied to the collection of food donationsspa
dc.relation.referencesBaldacci, R., Christo des, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming 115(2), 351{385 (2008)spa
dc.relation.referencesCampo, A.J.R., de la Pe~na, M.G.B., Escobar, J.W.: Dise~no de un modelo matem atico para el despacho de veh culos de emergencias m edicas en Colombia. Ph.D. thesis, Ponti cia Universidad Javeriana. Cali (2012)spa
dc.relation.referencesCarrillo, M., Felipe, A.: Modelo de ruteo de veh culos para la distribuci on de las empresas laboratorios veterland, Laboratorios Callbest y Cosm eticos Marlio u Par s. B.S. thesis, Facultad de Ingenier a (2014)spa
dc.relation.referencesJ. Romero et al.spa
dc.relation.referencesChristo des, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical programming 20(1), 255{282 (1981)spa
dc.relation.referencesChristo des, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145{164 (1981)spa
dc.relation.referencesClarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations research 12(4), 568{581 (1964)spa
dc.relation.referencesDantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management science 6(1), 80{91 (1959)spa
dc.relation.referencesFlood, M.M.: The traveling-salesman problem. Operations research 4(1), 61{75 (1956)spa
dc.relation.referencesFukasawa, R., Longo, H., Lysgaard, J., de Arag~ao, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical programming 106(3), 491{511 (2006)spa
dc.relation.referencesGarc a, G.: Aplicaci on de la heur stica de space lling curves en problemas de ruteo de veh culos (vrp) (2005)spa
dc.relation.referencesGendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management science 40(10), 1276{1290 (1994)spa
dc.relation.referencesGhiani, G., Laporte, G., Musmanno, R.: Introduction to logistics systems planning and control. John Wiley & Sons (2004)spa
dc.relation.referencesJacobo-Cabrera, M., Caballero-Morales, S.O., Mart nez-Flores, J.L., Cano-Olivos, P.: Decision model for the pharmaceutical distribution of insulin. In: International Conference on Applied Informatics. pp. 75{89. Springer (2018)spa
dc.relation.referencesLaporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distanceconstrained vehicle routing problem. Networks 14(1), 161{172 (1984)spa
dc.relation.referencesLaporte, G., Toth, P., Vigo, D.: Vehicle routing: historical perspective and recent contributions (2013)spa
dc.relation.referencesMedina, L.B.R., La Rotta, E.C.G., Castro, J.A.O.: Una revisi on al estado del arte del problema de ruteo de veh culos: Evoluci on hist orica y m etodos de soluci on. Ingenier a 16(2), 35{55 (2011)spa
dc.relation.referencesPisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & operations research 34(8), 2403{2435 (2007)spa
dc.relation.referencesSantana, L., Ramiro, E., Romero Carvajal, J.d.J.: A hybrid column generation and clustering approach to the school bus routing problem with time windows. Ingenier a 20(1), 101{117 (2015)spa
dc.relation.referencesTaillard, E.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661{673 (1993)spa
dc.relation.referencesToth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123(1-3), 487{512 (2002)spa
dc.relation.referencesToth, P., Vigo, D.: The vehicle routing problem. SIAM (2002)spa
dc.relation.referencesToth, P., Vigo, D.: The granular tabu search and its application to the vehiclerouting problem. Informs Journal on computing 15(4), 333{346 (2003)spa
dc.relation.referencesToth, P., Vigo, D.: Vehicle routing: problems, methods, and applications. SIAM (2014)spa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.localAbierto (Texto Completo)spa
dc.subjectRuteospa
dc.subjectDistribuciónspa
dc.subject.keywordOpen source toolsspa
dc.subject.lembLogística empresarialspa
dc.subject.lembDistribución física de mercancíasspa
dc.subject.lembReparto de mercancíasspa
dc.titleA vehicle routing application for retail delivery with open source toolsspa
dc.type.driverinfo:eu-repo/semantics/bachelorThesisspa
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersionspa
dc.type.localTrabajo de grado de pregradospa

Archivos

Bloque original

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
Trabajo de grado.pdf
Tamaño:
1.94 MB
Formato:
Adobe Portable Document Format
Descripción:
Trabajo de grado

Bloque de licencias

Mostrando 1 - 2 de 2
Cargando...
Miniatura
Nombre:
license.txt
Tamaño:
2.87 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Cargando...
Miniatura
Nombre:
Ficha descriptiva.pdf
Tamaño:
349.82 KB
Formato:
Adobe Portable Document Format
Descripción:
Licencia de autorización