{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T22:16:42Z","timestamp":1773008202647,"version":"3.50.1"},"reference-count":56,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:00:00Z","timestamp":1767139200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:00:00Z","timestamp":1767139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201908310007"],"award-info":[{"award-number":["201908310007"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>This paper studies a combined delivery strategy involving a private vehicle and external carriers under stochastic customer demands. The routing problem focuses on a single private vehicle, while external carriers are allowed to determine their own routes independently and are compensated with a fixed price per unit demand served. A strategy incorporating routing re\u2010optimization is proposed, along with a new recourse mechanism that leverages outsourcing through external carriers. To enable routing re\u2010optimization, a novel approximate linear programming (ALP) approach is introduced. This offers a new pathway for addressing vehicle routing problems (VRPs) under stochastic demand considerations. The ALP approach is adapted to the specific structure of routing under stochastic demands, leading to the development of a decomposition\u2010based ALP solution framework. This adaptation arises from changes in the decision sequence of routing and restocking at each step of the Markov decision process (MDP), which differs from previous formulations of vehicle routing under stochastic demands. Additionally, further adaptations are made to facilitate the computation of the proposed strategy by exploring the relationships among variables and constraints specific to the problem context, as well as by developing a constraint sampling procedure designed to mimic the near\u2010optimal heuristic policy. Our numerical results show that the proposed outsourcing\u2010based policy yields notable operating\u2010cost savings, with an average improvement of 4.06% over the traditional recourse strategy in midpoint\u2010depot instances. Moreover, in small instances where the optimal policy within the traditional partial re\u2010optimization framework can be computed, the proposed price\u2010directed (PD) policy still provides cost advantages over this re\u2010optimization scheme, demonstrating the value of our ALP\u2010based framework.<\/jats:p>","DOI":"10.1002\/net.70024","type":"journal-article","created":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T11:33:40Z","timestamp":1767180820000},"page":"266-288","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partial\u2010Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands"],"prefix":"10.1002","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2461-597X","authenticated-orcid":false,"given":"Lin","family":"Zhu","sequence":"first","affiliation":[{"name":"Logistics Research Center Shanghai Maritime University  Shanghai China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6996-0742","authenticated-orcid":false,"given":"Yossiri","family":"Adulyasak","sequence":"additional","affiliation":[{"name":"GERAD and Department of Logistics and Operations Management HEC Montr\u00e9al  Montr\u00e9al Quebec Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6949-6014","authenticated-orcid":false,"given":"Louis\u2010Martin","family":"Rousseau","sequence":"additional","affiliation":[{"name":"CIRRELT and Department of Mathematical and Industrial Engineering Polytechnique Montr\u00e9al  Montr\u00e9al Quebec Canada"}]}],"member":"311","published-online":{"date-parts":[[2025,12,31]]},"reference":[{"key":"e_1_2_15_2_1","unstructured":"M.Joerss F.Neuhaus andJ.Schr\u00f6der \u201cHow Customer Demands Are Reshaping Last\u2010Mile Delivery \u201d(2016) https:\/\/www.mckinsey.com\/industries\/logistics\/our\u2010insights\/how\u2010customer\u2010demands\u2010are\u2010reshaping\u2010last\u2010mile\u2010delivery."},{"key":"e_1_2_15_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0803"},{"key":"e_1_2_15_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1101"},{"key":"e_1_2_15_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.03.049"},{"key":"e_1_2_15_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0852"},{"key":"e_1_2_15_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21628"},{"key":"e_1_2_15_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0709"},{"key":"e_1_2_15_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.08.067"},{"key":"e_1_2_15_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0940"},{"key":"e_1_2_15_11_1","unstructured":"Meituan \u201cMeituan Delivery Platform \u201d(2025) https:\/\/waimaie.meituan.com\/."},{"key":"e_1_2_15_12_1","unstructured":"Ele.me \u201cEle.me Delivery Service \u201d(2025) https:\/\/www.ele.me\/."},{"key":"e_1_2_15_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.03.023"},{"key":"e_1_2_15_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0520"},{"key":"e_1_2_15_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.51.6.850.24925"},{"key":"e_1_2_15_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1301"},{"key":"e_1_2_15_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.00038"},{"key":"e_1_2_15_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3289"},{"key":"e_1_2_15_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1953"},{"key":"e_1_2_15_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2354"},{"key":"e_1_2_15_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2022.01108"},{"key":"e_1_2_15_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1129"},{"key":"e_1_2_15_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.04.023"},{"key":"e_1_2_15_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13219"},{"key":"e_1_2_15_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2018.09.011"},{"key":"e_1_2_15_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104806"},{"key":"e_1_2_15_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68496-3_4"},{"key":"e_1_2_15_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.10.045"},{"key":"e_1_2_15_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.040"},{"key":"e_1_2_15_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.1.99.12278"},{"key":"e_1_2_15_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0780"},{"key":"e_1_2_15_32_1","volume-title":"A Set\u2010Partitioning\u2010Based Model for the Stochastic Vehicle Routing Problem, 06T\u2010008","author":"Novoa C.","year":"2006"},{"key":"e_1_2_15_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0876"},{"key":"e_1_2_15_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-018-0126-y"},{"key":"e_1_2_15_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00146-X"},{"key":"e_1_2_15_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.5.796.10608"},{"key":"e_1_2_15_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1127"},{"key":"e_1_2_15_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2015.0591"},{"key":"e_1_2_15_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.03.027"},{"key":"e_1_2_15_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0767"},{"key":"e_1_2_15_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.5.4.348.24884"},{"key":"e_1_2_15_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0114"},{"key":"e_1_2_15_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0368"},{"key":"e_1_2_15_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0291"},{"key":"e_1_2_15_45_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2013.0551"},{"key":"e_1_2_15_46_1","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2014.905733"},{"key":"e_1_2_15_47_1","doi-asserted-by":"publisher","DOI":"10.1111\/poms.12395"},{"key":"e_1_2_15_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1101209"},{"key":"e_1_2_15_49_1","unstructured":"R.Fukasawa A. S.Barboza andA.Toriello \u201cOn the Strength of Approximate Linear Programming Relaxations for the Traveling Salesman Problem \u201d(2016) http:\/\/www2.isye.gatech.edu\/\u223catoriello3\/bcpalp.pdf."},{"key":"e_1_2_15_50_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0094"},{"key":"e_1_2_15_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-095-8_6"},{"key":"e_1_2_15_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586932"},{"key":"e_1_2_15_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1043"},{"key":"e_1_2_15_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580850"},{"key":"e_1_2_15_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.05.049"},{"key":"e_1_2_15_56_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025605803490"},{"key":"e_1_2_15_57_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.5.495"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70024","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.70024","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:16:43Z","timestamp":1773001003000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.70024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,31]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["10.1002\/net.70024"],"URL":"https:\/\/doi.org\/10.1002\/net.70024","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,31]]},"assertion":[{"value":"2025-07-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}