{"id":12765,"date":"2019-01-25T10:18:42","date_gmt":"2019-01-25T10:18:42","guid":{"rendered":"http:\/\/cio.edu.umh.es\/?p=12765"},"modified":"2019-01-25T10:18:42","modified_gmt":"2019-01-25T10:18:42","slug":"the-probabilistic-pickup-and-delivery-travelling-salesman-problem-2019-expert-systems-with-applications-121-313-323","status":"publish","type":"post","link":"https:\/\/cio.umh.es\/en\/2019\/01\/25\/the-probabilistic-pickup-and-delivery-travelling-salesman-problem-2019-expert-systems-with-applications-121-313-323\/","title":{"rendered":"The probabilistic pickup-and-delivery travelling salesman problem (2019). Expert Systems with Applications, 121, 313-323."},"content":{"rendered":"<p>[:es]<strong>Enrique Benavent <\/strong>(<em>University of Valencia<\/em>),\u00a0<strong>Mercedes Landete\u00a0<\/strong>(<em>Miguel Hern\u00e1ndez University of Elche<\/em>),<strong>\u00a0Juan Jos\u00e9 Salazar Gonz\u00e1lez<\/strong>\u00a0(<em>University of La Laguna)\u00a0<\/em>and\u00a0<strong>Gregorio\u00a0Tirado\u00a0<\/strong>(<em>Complutense University of Madrid<\/em>).<br \/>\n<strong>Abstract.<\/strong>\u00a0Transportation 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.<br \/>\n<strong>Keywords.\u00a0<\/strong>Travelling Saleman; Pickup-and-delivery; Probabilistic TSP[:]<\/p>","protected":false},"excerpt":{"rendered":"<p>[:es]Enrique Benavent (University of Valencia),\u00a0Mercedes Landete\u00a0(Miguel Hern\u00e1ndez University of Elche),\u00a0Juan Jos\u00e9 Salazar Gonz\u00e1lez\u00a0(University of La Laguna)\u00a0and\u00a0Gregorio\u00a0Tirado\u00a0(Complutense University of Madrid).<br \/>\nAbstract.\u00a0Transportation 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 [&#8230;]<\/p>","protected":false},"author":3477,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[369888],"tags":[],"_links":{"self":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/12765"}],"collection":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/users\/3477"}],"replies":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/comments?post=12765"}],"version-history":[{"count":0,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/12765\/revisions"}],"wp:attachment":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/media?parent=12765"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/categories?post=12765"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/tags?post=12765"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}