VRP model with time window, multiproduct and multidepot

With the increase in the transfer of products in supply chains, the organization of routes requires a complex allocation insofar as different environmental variables are considered, and VRP models are an efficient tool for the solution of routing systems of low, medium and high complexity. In this paper, we developed a vehicle routing model with hard time window, multidepot, multiproduct and heterogeneous fleet for the minimization of the distance travelled. We applied the model to a case study of a company that distributes water bottles and bales in which we made a new distribution of delivery schedules by order applied Pareto analysis. We obtained optimal computational results using exact methods in a very short computational time and minimizing the distance to 35.08% of the current route.

• Autores: Ruiz-Meza, José; Montes, Isaid; Pérez, Arnoldo; Ramos-Márquez, María
• Fecha de publicación: 2020
• Institución: Universidad Tecnológica de Bolívar
• Repositorio: Repositorio Institucional UTB
• Idioma: eng
• OAI Identifier: oai:repositorio.utb.edu.co:20.500.12585/9537
• Acceso en línea: https://hdl.handle.net/20.500.12585/9537; http://jase.tku.edu.tw/articles/jase-202006-23-2-0008
• Palabra clave: Pareto analysis; Mathematical model; Vehicle routing; Optimization
• Rights: openAccess
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/