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

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 sear...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Sebastián Dávila, Miguel Alfaro, Guillermo Fuertes, Manuel Vargas, Mauricio Camargo
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	supply chain management optimization vehicle routing problem chaotic search tabu search Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/0ceae575c7754276b4b1c646ea63669b
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:0ceae575c7754276b4b1c646ea63669b
record_format	dspace
spelling	oai:doaj.org-article:0ceae575c7754276b4b1c646ea63669b2021-11-11T18:17:54ZVehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile10.3390/math92127502227-7390https://doaj.org/article/0ceae575c7754276b4b1c646ea63669b2021-10-01T00:00:00Zhttps://www.mdpi.com/2227-7390/9/21/2750https://doaj.org/toc/2227-7390The 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.Sebastián DávilaMiguel AlfaroGuillermo FuertesManuel VargasMauricio CamargoMDPI AGarticlesupply chain managementoptimizationvehicle routing problemchaotic searchtabu searchMathematicsQA1-939ENMathematics, Vol 9, Iss 2750, p 2750 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	supply chain management optimization vehicle routing problem chaotic search tabu search Mathematics QA1-939
spellingShingle	supply chain management optimization vehicle routing problem chaotic search tabu search Mathematics QA1-939 Sebastián Dávila Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
description	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.
format	article
author	Sebastián Dávila Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo
author_facet	Sebastián Dávila Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo
author_sort	Sebastián Dávila
title	Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
title_short	Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
title_full	Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
title_fullStr	Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
title_full_unstemmed	Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile
title_sort	vehicle routing problem with deadline and stochastic service times: case of the ice cream industry in santiago city of chile
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/0ceae575c7754276b4b1c646ea63669b
work_keys_str_mv	AT sebastiandavila vehicleroutingproblemwithdeadlineandstochasticservicetimescaseoftheicecreamindustryinsantiagocityofchile AT miguelalfaro vehicleroutingproblemwithdeadlineandstochasticservicetimescaseoftheicecreamindustryinsantiagocityofchile AT guillermofuertes vehicleroutingproblemwithdeadlineandstochasticservicetimescaseoftheicecreamindustryinsantiagocityofchile AT manuelvargas vehicleroutingproblemwithdeadlineandstochasticservicetimescaseoftheicecreamindustryinsantiagocityofchile AT mauriciocamargo vehicleroutingproblemwithdeadlineandstochasticservicetimescaseoftheicecreamindustryinsantiagocityofchile
_version_	1718431865409372160

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

Ejemplares similares