A study on the effect of the asymmetry on real capacitated vehicle routing problems

Matrices with distances between pairs of locations are essential for solving vehicle routing problems like the Capacitated Vehicle Routing Problem (CVRP), Traveling Salesman Problem (TSP) and others. This work deals with the complex reality of transportation networks and asymmetry. Through a series...

Descripción completa

Detalles Bibliográficos
Autores: Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121, Ruiz García, Rubén
Tipo de recurso: artículo
Fecha de publicación:2012
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/37057
Acceso en línea:https://riunet.upv.es/handle/10251/37057
Access Level:acceso abierto
Palabra clave:Algorithms
Asymmetry
Capacitated vehicle routing problem
Road transportation networks
Complex reality
Geographical locations
Meta heuristics
Quality of solution
Solution time
Statistical experiments
Transportation network
Vehicle capacity
Vehicle Routing Problems
Network routing
Routing algorithms
Traveling salesman problem
Vehicle routing
Vehicles
Problem solving
ESTADISTICA E INVESTIGACION OPERATIVA
ORGANIZACION DE EMPRESAS
id ES_f4bfd67eedd7e2aedd4cc3ee7c52774c
oai_identifier_str oai:riunet.upv.es:10251/37057
network_acronym_str ES
network_name_str España
repository_id_str
spelling A study on the effect of the asymmetry on real capacitated vehicle routing problemsRodríguez Villalobos, Alejandro|||0000-0003-1079-6121Ruiz García, RubénAlgorithmsAsymmetryCapacitated vehicle routing problemRoad transportation networksComplex realityGeographical locationsMeta heuristicsQuality of solutionSolution timeStatistical experimentsTransportation networkVehicle capacityVehicle Routing ProblemsNetwork routingRouting algorithmsTraveling salesman problemVehicle routingVehiclesProblem solvingESTADISTICA E INVESTIGACION OPERATIVAORGANIZACION DE EMPRESASMatrices with distances between pairs of locations are essential for solving vehicle routing problems like the Capacitated Vehicle Routing Problem (CVRP), Traveling Salesman Problem (TSP) and others. This work deals with the complex reality of transportation networks and asymmetry. Through a series of comprehensive and thorough computational and statistical experiments we study the effect that many factors like asymmetry, geographical location of the depot and clients, demand, territory and maximum vehicle capacity have in the solution of CVRP instances. We examine both classical heuristics as well as current state-of-the-art metaheuristics and show that these methods are seriously affected by the studied factors from a solution time and quality of solutions perspective. We systematically compare the solutions obtained in the symmetric scenario with those obtained in the real asymmetric case at a quantitative as well as a qualitative level, with the objective of carefully measuring and understanding the differences between both cases. © 2011 Elsevier Ltd.The authors are indebted to Keld Helsgaun, Stefan Ropke and especially to Yuichi Nagata for their kind help, collaboration and for facilitating the binaries of their algorithms. This work is partially funded by the Spanish Ministry of Science and Innovation, under the project "SMPA-Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances" with reference DPI2008-03511/DPI. The authors should also thank the IMPIVA-Institute for the Small and Medium Valencian Enterprise, for the project TASER with reference IMDEEA/2011/142.ElsevierDepartamento de Organización de EmpresasInstituto Universitario Mixto de Tecnología de InformáticaEscuela Politécnica Superior de AlcoyMinisterio de Ciencia e InnovaciónInstituto de la Pequeña y Mediana Industria de la Generalitat ValencianaRepositorio Institucional de la Universitat Politècnica de València Riunet20122012-09-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/37057reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 DPI2008-03511 SMPA: SECUENCIACION MULTIOBJETIVO PARALELA AVANZADA: AVANCES TEORICOS Y PRACTICOSInstituto de la Pequeña y Mediana Industria de la Generalitat Valenciana IMPIVA IMDEEA%2F2011%2F142 TÉCNICAS AVANZADAS PARA SECUENCIACIÓN EN ENTORNOS REALISTAS (TASER)open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/370572026-06-13T07:49:27Z
dc.title.none.fl_str_mv A study on the effect of the asymmetry on real capacitated vehicle routing problems
title A study on the effect of the asymmetry on real capacitated vehicle routing problems
spellingShingle A study on the effect of the asymmetry on real capacitated vehicle routing problems
Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121
Algorithms
Asymmetry
Capacitated vehicle routing problem
Road transportation networks
Complex reality
Geographical locations
Meta heuristics
Quality of solution
Solution time
Statistical experiments
Transportation network
Vehicle capacity
Vehicle Routing Problems
Network routing
Routing algorithms
Traveling salesman problem
Vehicle routing
Vehicles
Problem solving
ESTADISTICA E INVESTIGACION OPERATIVA
ORGANIZACION DE EMPRESAS
title_short A study on the effect of the asymmetry on real capacitated vehicle routing problems
title_full A study on the effect of the asymmetry on real capacitated vehicle routing problems
title_fullStr A study on the effect of the asymmetry on real capacitated vehicle routing problems
title_full_unstemmed A study on the effect of the asymmetry on real capacitated vehicle routing problems
title_sort A study on the effect of the asymmetry on real capacitated vehicle routing problems
dc.creator.none.fl_str_mv Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121
Ruiz García, Rubén
author Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121
author_facet Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121
Ruiz García, Rubén
author_role author
author2 Ruiz García, Rubén
author2_role author
dc.contributor.none.fl_str_mv Departamento de Organización de Empresas
Instituto Universitario Mixto de Tecnología de Informática
Escuela Politécnica Superior de Alcoy
Ministerio de Ciencia e Innovación
Instituto de la Pequeña y Mediana Industria de la Generalitat Valenciana
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Algorithms
Asymmetry
Capacitated vehicle routing problem
Road transportation networks
Complex reality
Geographical locations
Meta heuristics
Quality of solution
Solution time
Statistical experiments
Transportation network
Vehicle capacity
Vehicle Routing Problems
Network routing
Routing algorithms
Traveling salesman problem
Vehicle routing
Vehicles
Problem solving
ESTADISTICA E INVESTIGACION OPERATIVA
ORGANIZACION DE EMPRESAS
topic Algorithms
Asymmetry
Capacitated vehicle routing problem
Road transportation networks
Complex reality
Geographical locations
Meta heuristics
Quality of solution
Solution time
Statistical experiments
Transportation network
Vehicle capacity
Vehicle Routing Problems
Network routing
Routing algorithms
Traveling salesman problem
Vehicle routing
Vehicles
Problem solving
ESTADISTICA E INVESTIGACION OPERATIVA
ORGANIZACION DE EMPRESAS
description Matrices with distances between pairs of locations are essential for solving vehicle routing problems like the Capacitated Vehicle Routing Problem (CVRP), Traveling Salesman Problem (TSP) and others. This work deals with the complex reality of transportation networks and asymmetry. Through a series of comprehensive and thorough computational and statistical experiments we study the effect that many factors like asymmetry, geographical location of the depot and clients, demand, territory and maximum vehicle capacity have in the solution of CVRP instances. We examine both classical heuristics as well as current state-of-the-art metaheuristics and show that these methods are seriously affected by the studied factors from a solution time and quality of solutions perspective. We systematically compare the solutions obtained in the symmetric scenario with those obtained in the real asymmetric case at a quantitative as well as a qualitative level, with the objective of carefully measuring and understanding the differences between both cases. © 2011 Elsevier Ltd.
publishDate 2012
dc.date.none.fl_str_mv 2012
2012-09-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/37057
url https://riunet.upv.es/handle/10251/37057
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 DPI2008-03511 SMPA: SECUENCIACION MULTIOBJETIVO PARALELA AVANZADA: AVANCES TEORICOS Y PRACTICOS
Instituto de la Pequeña y Mediana Industria de la Generalitat Valenciana IMPIVA IMDEEA%2F2011%2F142 TÉCNICAS AVANZADAS PARA SECUENCIACIÓN EN ENTORNOS REALISTAS (TASER)
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869424500175536128
score 15,300724

Similares en LA Referencia