The probabilistic pickup-and-delivery travelling salesman problem

•Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Tran...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications 2019-05, Vol.121, p.313-323
Hauptverfasser: Benavent, Enrique, Landete, Mercedes, Salazar-González, Juan-José, Tirado, Gregorio
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 323
container_issue
container_start_page 313
container_title Expert systems with applications
container_volume 121
creator Benavent, Enrique
Landete, Mercedes
Salazar-González, Juan-José
Tirado, Gregorio
description •Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Transportation problems are essential in commercial logistics and have been widely studied in the literature 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.
doi_str_mv 10.1016/j.eswa.2018.12.028
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2178125243</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0957417418307954</els_id><sourcerecordid>2178125243</sourcerecordid><originalsourceid>FETCH-LOGICAL-c376t-f42f0c0b4d7451bd26242d298d0c5b885758b3d448dc5893b36a568cf7b6fd003</originalsourceid><addsrcrecordid>eNp9kDtPwzAUhS0EEqXwB5giMSf4GTsSS1VBQarEUmbLjxtwSJNgp0X996SUmeku5zvn6kPoluCCYFLeNwWkb1NQTFRBaIGpOkMzoiTLS1mxczTDlZA5J5JfoquUGoyJxFjO0GLzAdkQe2tsaEMag8uG4D53Q246n3towx7iIRuj2UPbhu49S6aFtDXdL9XC9hpd1KZNcPN35-jt6XGzfM7Xr6uX5WKdOybLMa85rbHDlnvJBbGelpRTTyvlsRNWKSGFssxzrrwTqmKWlUaUytXSlrXHmM3R3al32v3aQRp10-9iN01qSqQiVFDOphQ9pVzsU4pQ6yGGrYkHTbA-qtKNPqrSR1WaUD2pmqCHEwTT__sAUScXoHPgQwQ3at-H__AfbflyCg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2178125243</pqid></control><display><type>article</type><title>The probabilistic pickup-and-delivery travelling salesman problem</title><source>Access via ScienceDirect (Elsevier)</source><creator>Benavent, Enrique ; Landete, Mercedes ; Salazar-González, Juan-José ; Tirado, Gregorio</creator><creatorcontrib>Benavent, Enrique ; Landete, Mercedes ; Salazar-González, Juan-José ; Tirado, Gregorio</creatorcontrib><description>•Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Transportation problems are essential in commercial logistics and have been widely studied in the literature 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.</description><identifier>ISSN: 0957-4174</identifier><identifier>EISSN: 1873-6793</identifier><identifier>DOI: 10.1016/j.eswa.2018.12.028</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Commodities ; Formulations ; Heuristic methods ; Logistics ; Pickup-and-delivery ; Polynomials ; Probabilistic TSP ; Route planning ; Routing ; Statistical analysis ; Traveling salesman problem ; Travelling Salesman ; Vehicle routing</subject><ispartof>Expert systems with applications, 2019-05, Vol.121, p.313-323</ispartof><rights>2018 Elsevier Ltd</rights><rights>Copyright Elsevier BV May 1, 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c376t-f42f0c0b4d7451bd26242d298d0c5b885758b3d448dc5893b36a568cf7b6fd003</citedby><cites>FETCH-LOGICAL-c376t-f42f0c0b4d7451bd26242d298d0c5b885758b3d448dc5893b36a568cf7b6fd003</cites><orcidid>0000-0002-5201-0476</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.eswa.2018.12.028$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Benavent, Enrique</creatorcontrib><creatorcontrib>Landete, Mercedes</creatorcontrib><creatorcontrib>Salazar-González, Juan-José</creatorcontrib><creatorcontrib>Tirado, Gregorio</creatorcontrib><title>The probabilistic pickup-and-delivery travelling salesman problem</title><title>Expert systems with applications</title><description>•Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Transportation problems are essential in commercial logistics and have been widely studied in the literature 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.</description><subject>Commodities</subject><subject>Formulations</subject><subject>Heuristic methods</subject><subject>Logistics</subject><subject>Pickup-and-delivery</subject><subject>Polynomials</subject><subject>Probabilistic TSP</subject><subject>Route planning</subject><subject>Routing</subject><subject>Statistical analysis</subject><subject>Traveling salesman problem</subject><subject>Travelling Salesman</subject><subject>Vehicle routing</subject><issn>0957-4174</issn><issn>1873-6793</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kDtPwzAUhS0EEqXwB5giMSf4GTsSS1VBQarEUmbLjxtwSJNgp0X996SUmeku5zvn6kPoluCCYFLeNwWkb1NQTFRBaIGpOkMzoiTLS1mxczTDlZA5J5JfoquUGoyJxFjO0GLzAdkQe2tsaEMag8uG4D53Q246n3towx7iIRuj2UPbhu49S6aFtDXdL9XC9hpd1KZNcPN35-jt6XGzfM7Xr6uX5WKdOybLMa85rbHDlnvJBbGelpRTTyvlsRNWKSGFssxzrrwTqmKWlUaUytXSlrXHmM3R3al32v3aQRp10-9iN01qSqQiVFDOphQ9pVzsU4pQ6yGGrYkHTbA-qtKNPqrSR1WaUD2pmqCHEwTT__sAUScXoHPgQwQ3at-H__AfbflyCg</recordid><startdate>20190501</startdate><enddate>20190501</enddate><creator>Benavent, Enrique</creator><creator>Landete, Mercedes</creator><creator>Salazar-González, Juan-José</creator><creator>Tirado, Gregorio</creator><general>Elsevier Ltd</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-5201-0476</orcidid></search><sort><creationdate>20190501</creationdate><title>The probabilistic pickup-and-delivery travelling salesman problem</title><author>Benavent, Enrique ; Landete, Mercedes ; Salazar-González, Juan-José ; Tirado, Gregorio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c376t-f42f0c0b4d7451bd26242d298d0c5b885758b3d448dc5893b36a568cf7b6fd003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Commodities</topic><topic>Formulations</topic><topic>Heuristic methods</topic><topic>Logistics</topic><topic>Pickup-and-delivery</topic><topic>Polynomials</topic><topic>Probabilistic TSP</topic><topic>Route planning</topic><topic>Routing</topic><topic>Statistical analysis</topic><topic>Traveling salesman problem</topic><topic>Travelling Salesman</topic><topic>Vehicle routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Benavent, Enrique</creatorcontrib><creatorcontrib>Landete, Mercedes</creatorcontrib><creatorcontrib>Salazar-González, Juan-José</creatorcontrib><creatorcontrib>Tirado, Gregorio</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Expert systems with applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Benavent, Enrique</au><au>Landete, Mercedes</au><au>Salazar-González, Juan-José</au><au>Tirado, Gregorio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The probabilistic pickup-and-delivery travelling salesman problem</atitle><jtitle>Expert systems with applications</jtitle><date>2019-05-01</date><risdate>2019</risdate><volume>121</volume><spage>313</spage><epage>323</epage><pages>313-323</pages><issn>0957-4174</issn><eissn>1873-6793</eissn><abstract>•Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Transportation problems are essential in commercial logistics and have been widely studied in the literature 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.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.eswa.2018.12.028</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-5201-0476</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0957-4174
ispartof Expert systems with applications, 2019-05, Vol.121, p.313-323
issn 0957-4174
1873-6793
language eng
recordid cdi_proquest_journals_2178125243
source Access via ScienceDirect (Elsevier)
subjects Commodities
Formulations
Heuristic methods
Logistics
Pickup-and-delivery
Polynomials
Probabilistic TSP
Route planning
Routing
Statistical analysis
Traveling salesman problem
Travelling Salesman
Vehicle routing
title The probabilistic pickup-and-delivery travelling salesman problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T18%3A40%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20probabilistic%20pickup-and-delivery%20travelling%20salesman%20problem&rft.jtitle=Expert%20systems%20with%20applications&rft.au=Benavent,%20Enrique&rft.date=2019-05-01&rft.volume=121&rft.spage=313&rft.epage=323&rft.pages=313-323&rft.issn=0957-4174&rft.eissn=1873-6793&rft_id=info:doi/10.1016/j.eswa.2018.12.028&rft_dat=%3Cproquest_cross%3E2178125243%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2178125243&rft_id=info:pmid/&rft_els_id=S0957417418307954&rfr_iscdi=true