{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:15:47Z","timestamp":1772939747912,"version":"3.50.1"},"reference-count":21,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:00:00Z","timestamp":1649462400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100017109","name":"Transportation Consortium of South-Central States","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017109","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the Pickup\u2010and\u2010Delivery Traveling Salesman Problem with Handling Costs (PDTSPH), a single vehicle has to satisfy multiple customer requests, each defined by a pickup location and a delivery location. Cargo handling is performed at the rear end of the vehicle, in a Last\u2010In\u2010First\u2010Out (LIFO) order for PDTSPH. However, additional handling operations are permitted with a penalty if other loads that block the access to the delivery have to be unloaded and reloaded. The objective of PDTSPH is to minimize the total transportation and handling cost. In this paper, we present a new Mixed Integer Programming (MIP) model and a branch\u2010and\u2010cut algorithm to solve PDTSPH. We also present new integral separation procedures to effectively handle the exponential number of constraints in our MIP model. A family of inequalities are introduced to enhance the scalability of our implementation. The performance of our approach is compared with a compact formulation from the literature (Veenstra et al. [21]) in instances ranging from 9 to 21 customer requests. Computational results show our algorithm outperforming the compact formulation in 69% of instances with an average runtime improvement of 57%.<\/jats:p>","DOI":"10.1002\/net.22096","type":"journal-article","created":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T08:20:48Z","timestamp":1649492448000},"page":"297-313","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A branch\u2010and\u2010cut algorithm for the pickup\u2010and\u2010delivery traveling salesman problem with handling costs"],"prefix":"10.1002","volume":"80","author":[{"given":"Devaraj","family":"Radha Krishnan","sequence":"first","affiliation":[{"name":"School of Industrial Engineering and Management Oklahoma State University  Stillwater Oklahoma USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8104-2701","authenticated-orcid":false,"given":"Tieming","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Industrial Engineering and Management Oklahoma State University  Stillwater Oklahoma USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2022,4,9]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585767"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1100.0316"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.3138\/infor.45.4.223"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0202"},{"key":"e_1_2_10_6_1","unstructured":"L.Cassani Algoritmi euristici per il \u201cTSP with rear\u2010loading\u201d. Degree thesis Universita di Milano Italy 2004."},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0283"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20312"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_15"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21459"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.013"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20192"},{"key":"e_1_2_10_15_1","unstructured":"D. V. R.Krishnan Effective algorithms for pickup and delivery problems with loading restrictions and handling costs PhD thesis Oklahoma State University 2020."},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081068408717261"},{"key":"e_1_2_10_17_1","unstructured":"A.Malapert C.Gu\u00e9ret N.Jussien A.Langevin andL.\u2010M.Rousseau Two\u2010dimensional pickup and delivery routing problem with loading constraints Proc 1st CPAIOR Workshop Bin Packing Placement Constraints (BPPC'08) Institut Henri Poincar\u00e9 Paris France 2008 p.\u00a0184."},{"key":"e_1_2_10_18_1","first-page":"69","article-title":"Problemas de rutas con carga y descarga en sistemas LIFO: soluciones exactas","volume":"3","author":"Pacheco J.","year":"1995","journal-title":"Estudios de econom\u00eda aplicada"},{"key":"e_1_2_10_19_1","first-page":"153","article-title":"Heur\u00edstico para los problemas de rutas con carga y descarga en sistemas LIFO","volume":"21","author":"Pacheco J.","year":"1997","journal-title":"Questiio"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(97)00090-4"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.009"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.22096","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.22096","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.22096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T22:03:15Z","timestamp":1692741795000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.22096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1002\/net.22096"],"URL":"https:\/\/doi.org\/10.1002\/net.22096","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,9]]},"assertion":[{"value":"2021-10-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}