Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile

Sebastián Dávila, Miguel Alfaro, Guillermo Fuertes, Manuel Vargas and Mauricio Camargo
Additional contact information
Sebastián Dávila: Industrial Engineering Department, University of Santiago de Chile, Avenida Ecuador 3769, Santiago 9170124, Chile
Miguel Alfaro: Industrial Engineering Department, University of Santiago de Chile, Avenida Ecuador 3769, Santiago 9170124, Chile
Guillermo Fuertes: Industrial Engineering Department, University of Santiago de Chile, Avenida Ecuador 3769, Santiago 9170124, Chile
Manuel Vargas: Industrial Engineering Department, University of Santiago de Chile, Avenida Ecuador 3769, Santiago 9170124, Chile
Mauricio Camargo: Université de Lorraine, ERPI, F-54000 Nancy, France

Mathematics, 2021, vol. 9, issue 21, 1-18

Abstract: The research evaluates the vehicular routing problem for distributing refrigerated products. The mathematical model corresponds to the vehicle routing problem with hard time windows and a stochastic service time (VRPTW-ST) model applied in Santiago de Chile. For model optimization, we used tabu search, chaotic search and general algebraic modeling. The model’s objective function is to minimize the total distance traveled and the number of vehicles using stochastic waiting restrictions at the customers’ facilities. The experiments were implemented in ten scenarios by modifying the number of customers. Experiments were established with several customers that can be solved using the general algebraic modeling technique in order to validate the tabu search and the chaotic search methods. The study considered two algorithms modified with Monte Carlo (tabu search and chaotic search). Additionally, two modified algorithms, TSv2 and CSv2, were proposed to reduce execution time. These algorithms were modified by delaying the Monte Carlo procedure until the first set of sub-optimal routes were found. The results validate the metaheuristic chaotic search to solve the VRPTW-ST. The chaotic search method obtained a superior performance than the tabu search method when solving a real problem in a large city. Finally, the experiments demonstrated a direct relationship between the percentage of customers with stochastic waiting time and the model resolution time.

Keywords: supply chain management; optimization; vehicle routing problem; chaotic search; tabu search (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/21/2750/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/21/2750/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:21:p:2750-:d:668032

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().