The Probabilistic Pickup-and-Delivery Travelling Salesman Problem

Transportation problems are essential in commercial logistics and have been widely studied in the litera- ture during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing pr...

ver descrição completa

Detalhes bibliográficos
Autores: Benavent, Enrique, Landete, Mercedes, Salazar González, Juan José, Tirado Domínguez, Gregorio
Formato: artículo
Fecha de publicación:2018
País:España
Recursos:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/91911
Acesso em linha:https://hdl.handle.net/20.500.14352/91911
Access Level:acceso abierto
Palavra-chave:Travelling Salesman
Pickup-and-Delivery
Probabilistic TSP
Investigación operativa (Matemáticas)
Comercio
1207 Investigación Operativa
5312.11 Comercio
id ES_ba57a0f4db59622768df57a547d71cd5
oai_identifier_str oai:docta.ucm.es:20.500.14352/91911
network_acronym_str ES
network_name_str España
repository_id_str
spelling The Probabilistic Pickup-and-Delivery Travelling Salesman ProblemBenavent, EnriqueLandete, MercedesSalazar González, Juan JoséTirado Domínguez, GregorioTravelling SalesmanPickup-and-DeliveryProbabilistic TSPInvestigación operativa (Matemáticas)Comercio1207 Investigación Operativa5312.11 ComercioTransportation problems are essential in commercial logistics and have been widely studied in the litera- ture during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing problem where there is susceptibility to uncertainty in customer requests. The probability distributions of the requests are assumed to be known, and the objective is to design an a priori route with minimum expected length. The problem has already been approached in the literature, but through a heuristic method. This article proposes the first exact approach to the problem. Two mathematical formulations are proposed: one is a compact model (i.e. defined by a polynomial number of variables and constraints); the other one contains an exponential number of inequalities and is solved within a branch-and-cut framework. Computational results show the upsides as well as the breakdowns of both formulations.ElsevierUniversidad Complutense de Madrid20182018-01-0120182018-01-01journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/20.500.14352/91911reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)InglésengMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-68097-PMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-63680-RMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-65803-RCASI-CAM S2013 ICE-2845open accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/919112026-06-02T12:44:21Z
dc.title.none.fl_str_mv The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
title The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
spellingShingle The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
Benavent, Enrique
Travelling Salesman
Pickup-and-Delivery
Probabilistic TSP
Investigación operativa (Matemáticas)
Comercio
1207 Investigación Operativa
5312.11 Comercio
title_short The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
title_full The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
title_fullStr The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
title_full_unstemmed The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
title_sort The Probabilistic Pickup-and-Delivery Travelling Salesman Problem
dc.creator.none.fl_str_mv Benavent, Enrique
Landete, Mercedes
Salazar González, Juan José
Tirado Domínguez, Gregorio
author Benavent, Enrique
author_facet Benavent, Enrique
Landete, Mercedes
Salazar González, Juan José
Tirado Domínguez, Gregorio
author_role author
author2 Landete, Mercedes
Salazar González, Juan José
Tirado Domínguez, Gregorio
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv Travelling Salesman
Pickup-and-Delivery
Probabilistic TSP
Investigación operativa (Matemáticas)
Comercio
1207 Investigación Operativa
5312.11 Comercio
topic Travelling Salesman
Pickup-and-Delivery
Probabilistic TSP
Investigación operativa (Matemáticas)
Comercio
1207 Investigación Operativa
5312.11 Comercio
description Transportation problems are essential in commercial logistics and have been widely studied in the litera- ture during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing problem where there is susceptibility to uncertainty in customer requests. The probability distributions of the requests are assumed to be known, and the objective is to design an a priori route with minimum expected length. The problem has already been approached in the literature, but through a heuristic method. This article proposes the first exact approach to the problem. Two mathematical formulations are proposed: one is a compact model (i.e. defined by a polynomial number of variables and constraints); the other one contains an exponential number of inequalities and is solved within a branch-and-cut framework. Computational results show the upsides as well as the breakdowns of both formulations.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-01-01
2018
2018-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/91911
url https://hdl.handle.net/20.500.14352/91911
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 Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-68097-P
Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-63680-R
Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 Not available MTM2015-65803-R
CASI-CAM S2013 ICE-2845
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.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
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417889685045248
score 15.198674

Registos relacionados