Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)

Descripción del Articulo

This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The s...

Descripción completa

Detalles Bibliográficos
Autores: Machuca-de-Pina, Juan Manuel, Dorin, Michael, García-Yi, Alicia-Isabel
Formato: artículo
Fecha de Publicación:2018
Institución:Universidad de Lima
Repositorio:Revistas - Universidad de Lima
Lenguaje:español
OAI Identifier:oai:revistas.ulima.edu.pe:article/2956
Enlace del recurso:https://revistas.ulima.edu.pe/index.php/Interfases/article/view/2956
Nivel de acceso:acceso abierto
Materia:linear programming
complexity
routing
vehicles
delivery points
programación lineal
complejidad
ruteo
vehículos
puntos de entrega
id REVULIMA_02c7a68f70c75862bdc850c6537e798e
oai_identifier_str oai:revistas.ulima.edu.pe:article/2956
network_acronym_str REVULIMA
network_name_str Revistas - Universidad de Lima
repository_id_str
spelling Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)Machuca-de-Pina, Juan ManuelDorin, MichaelGarcía-Yi, Alicia-Isabellinear programmingcomplexityroutingvehiclesdelivery pointsprogramación linealcomplejidadruteovehículospuntos de entregaThis article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.El presente articulo tiene como objetivo proponer un criterio cuantitativo para evaluar la viabilidad de implementar soluciones basadas en programacion lineal para resolver el problema de ruteo de vehiculos (VRP). Se utilizo un diseno experimental para medir el tiempo relativo de solucion con un modelo de programacion lineal propuesto. La muestra utilizada fue aleatoria utilizando tres escenarios de dispersion de puntos de entrega: poco dispersos, dispersos y muy dispersos. Se utilizo un solver de programacion lineal con el objetivo de determinar el tiempo y las iteraciones necesarias para encontrar la solucion del modelo. Como resultado se encontro el tiempo de solucion en funcion de la cantidad de puntos de entrega, la cantidad de iteraciones para los escenarios propuestos y se pronostica el tiempo necesario para resolver el problema utilizando el modelo propuesto. Se concluye con una propuesta de cantidad de puntos viables para ser resueltos por programacion lineal.Universidad de Lima2018-12-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://revistas.ulima.edu.pe/index.php/Interfases/article/view/295610.26439/interfases2018.n011.2956Interfases; No. 011 (2018); 103-117Interfases; Núm. 011 (2018); 103-117Interfases; n. 011 (2018); 103-1171993-491210.26439/interfases2018.n011reponame:Revistas - Universidad de Limainstname:Universidad de Limainstacron:ULIMAspahttps://revistas.ulima.edu.pe/index.php/Interfases/article/view/2956/3189Derechos de autor 2019 Interfasesinfo:eu-repo/semantics/openAccessoai:revistas.ulima.edu.pe:article/29562023-07-24T13:32:31Z
dc.title.none.fl_str_mv Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)
title Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
spellingShingle Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
Machuca-de-Pina, Juan Manuel
linear programming
complexity
routing
vehicles
delivery points
programación lineal
complejidad
ruteo
vehículos
puntos de entrega
title_short Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
title_full Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
title_fullStr Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
title_full_unstemmed Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
title_sort Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
dc.creator.none.fl_str_mv Machuca-de-Pina, Juan Manuel
Dorin, Michael
García-Yi, Alicia-Isabel
author Machuca-de-Pina, Juan Manuel
author_facet Machuca-de-Pina, Juan Manuel
Dorin, Michael
García-Yi, Alicia-Isabel
author_role author
author2 Dorin, Michael
García-Yi, Alicia-Isabel
author2_role author
author
dc.subject.none.fl_str_mv linear programming
complexity
routing
vehicles
delivery points
programación lineal
complejidad
ruteo
vehículos
puntos de entrega
topic linear programming
complexity
routing
vehicles
delivery points
programación lineal
complejidad
ruteo
vehículos
puntos de entrega
description This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.
publishDate 2018
dc.date.none.fl_str_mv 2018-12-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://revistas.ulima.edu.pe/index.php/Interfases/article/view/2956
10.26439/interfases2018.n011.2956
url https://revistas.ulima.edu.pe/index.php/Interfases/article/view/2956
identifier_str_mv 10.26439/interfases2018.n011.2956
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv https://revistas.ulima.edu.pe/index.php/Interfases/article/view/2956/3189
dc.rights.none.fl_str_mv Derechos de autor 2019 Interfases
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Derechos de autor 2019 Interfases
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad de Lima
publisher.none.fl_str_mv Universidad de Lima
dc.source.none.fl_str_mv Interfases; No. 011 (2018); 103-117
Interfases; Núm. 011 (2018); 103-117
Interfases; n. 011 (2018); 103-117
1993-4912
10.26439/interfases2018.n011
reponame:Revistas - Universidad de Lima
instname:Universidad de Lima
instacron:ULIMA
instname_str Universidad de Lima
instacron_str ULIMA
institution ULIMA
reponame_str Revistas - Universidad de Lima
collection Revistas - Universidad de Lima
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1844893189962465280
score 12.9067135
Experimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)
Nota importante:
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).

Ejemplares Similares