Submitted:
06 January 2021
Posted:
15 January 2021
You are already at the latest version
Abstract
The research develops the vehicular routing problem for the distribution of refrigerated products in a multinational company. The mathematical model corresponds to the vehicle routing problem with hard time windows and stochastic service (VRPTW-ST) time model applied in the city of Santiago de Chile. For optimization of the model, optimization methods tabu search, chaotic search and general algebraic modeling were used. The results allow to validate the meta-heuristic chaotic search to solve the VRPTW-ST; chaotic search method obtains superior performance than tabu search method for solving a real problem in a large city.
Keywords:
vehicle routing problem
; Metaheuristics
; VRPTW-ST
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
