{"id":"https://openalex.org/W7117764697","doi":"https://doi.org/10.1002/net.70024","title":"Partial\u2010Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands","display_name":"Partial\u2010Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands","publication_year":2025,"publication_date":"2025-12-31","ids":{"openalex":"https://openalex.org/W7117764697","doi":"https://doi.org/10.1002/net.70024"},"language":"en","primary_location":{"id":"doi:10.1002/net.70024","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70024","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70024","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70024","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121671066","display_name":"Lin Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I96733725","display_name":"Shanghai Maritime University","ror":"https://ror.org/04z7qrj66","country_code":"CN","type":"education","lineage":["https://openalex.org/I96733725"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lin Zhu","raw_affiliation_strings":["Logistics Research Center Shanghai Maritime University  Shanghai China"],"raw_orcid":"https://orcid.org/0000-0002-2461-597X","affiliations":[{"raw_affiliation_string":"Logistics Research Center Shanghai Maritime University  Shanghai China","institution_ids":["https://openalex.org/I96733725"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037567541","display_name":"Yossiri Adulyasak","orcid":"https://orcid.org/0000-0002-6996-0742"},"institutions":[{"id":"https://openalex.org/I108192572","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27","country_code":"CA","type":"education","lineage":["https://openalex.org/I108192572"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yossiri Adulyasak","raw_affiliation_strings":["GERAD and Department of Logistics and Operations Management HEC Montr\u00e9al  Montr\u00e9al Quebec Canada"],"raw_orcid":"https://orcid.org/0000-0002-6996-0742","affiliations":[{"raw_affiliation_string":"GERAD and Department of Logistics and Operations Management HEC Montr\u00e9al  Montr\u00e9al Quebec Canada","institution_ids":["https://openalex.org/I108192572"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108798522","display_name":"Louis\u2010Martin Rousseau","orcid":null},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Louis\u2010Martin Rousseau","raw_affiliation_strings":["CIRRELT and Department of Mathematical and Industrial Engineering Polytechnique Montr\u00e9al  Montr\u00e9al Quebec Canada"],"raw_orcid":"https://orcid.org/0000-0001-6949-6014","affiliations":[{"raw_affiliation_string":"CIRRELT and Department of Mathematical and Industrial Engineering Polytechnique Montr\u00e9al  Montr\u00e9al Quebec Canada","institution_ids":["https://openalex.org/I45683168"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5121671066"],"corresponding_institution_ids":["https://openalex.org/I96733725"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65851447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"3","first_page":"266","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.968999981880188,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.968999981880188,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6007000207901001},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5694000124931335},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.531499981880188},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4546000063419342},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.42500001192092896},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.3772999942302704},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3610000014305115},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.35109999775886536}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6693999767303467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6434000134468079},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6007000207901001},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5694000124931335},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.531499981880188},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.35109999775886536},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.3158000111579895},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3122999966144562},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.27639999985694885},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.26510000228881836},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.70024","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70024","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70024","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:publications.polymtl.ca:71393","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.1002/net.70024","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70024","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70024","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8586936950","display_name":null,"funder_award_id":"201908310007","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7117764697.pdf","grobid_xml":"https://content.openalex.org/works/W7117764697.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W170657672","https://openalex.org/W1506300983","https://openalex.org/W1745373831","https://openalex.org/W1963733138","https://openalex.org/W1973220928","https://openalex.org/W2004959510","https://openalex.org/W2005944337","https://openalex.org/W2032444227","https://openalex.org/W2037219660","https://openalex.org/W2040666687","https://openalex.org/W2059128707","https://openalex.org/W2062245133","https://openalex.org/W2091219277","https://openalex.org/W2091932422","https://openalex.org/W2107472525","https://openalex.org/W2112686410","https://openalex.org/W2114552889","https://openalex.org/W2116283846","https://openalex.org/W2121204510","https://openalex.org/W2131387855","https://openalex.org/W2134092250","https://openalex.org/W2138810186","https://openalex.org/W2142728935","https://openalex.org/W2154706439","https://openalex.org/W2158479468","https://openalex.org/W2165356874","https://openalex.org/W2170412087","https://openalex.org/W2331159541","https://openalex.org/W2524034199","https://openalex.org/W2757930831","https://openalex.org/W2778922089","https://openalex.org/W2797064164","https://openalex.org/W2797624992","https://openalex.org/W2803158063","https://openalex.org/W2873879056","https://openalex.org/W2892219662","https://openalex.org/W2897799783","https://openalex.org/W2907351660","https://openalex.org/W2911357856","https://openalex.org/W2941075535","https://openalex.org/W2953891001","https://openalex.org/W2973520255","https://openalex.org/W2973926229","https://openalex.org/W3027448965","https://openalex.org/W3121728793","https://openalex.org/W4200391575","https://openalex.org/W4221122161","https://openalex.org/W4292790985","https://openalex.org/W4308195387","https://openalex.org/W4398182762","https://openalex.org/W4400919694"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"This":[1,82,121],"paper":[2],"studies":[3],"a":[4,9,24,43,59,73,84,116,185],"combined":[5],"delivery":[6],"strategy":[7,51,166,219],"involving":[8],"private":[10,26],"vehicle":[11,89,149],"and":[12,39,132,173],"external":[13,29,67],"carriers":[14,30],"under":[15,93,108,151],"stochastic":[16,94,109,152],"customer":[17],"demands.":[18,153],"The":[19,97],"routing":[20,53,71,90,107,131,150],"problem":[21,178],"focuses":[22],"on":[23],"single":[25],"vehicle,":[27],"while":[28],"are":[31,40,157],"allowed":[32],"to":[33,102,112,159,176,190],"determine":[34],"their":[35],"own":[36],"routes":[37],"independently":[38],"compensated":[41],"with":[42,58,209],"fixed":[44],"price":[45],"per":[46],"unit":[47],"demand":[48,95],"served.":[49],"A":[50],"incorporating":[52],"re\u2010optimization":[54,235,251],"is":[55,80,100],"proposed,":[56],"along":[57],"new":[60,85],"recourse":[61,218],"mechanism":[62],"that":[63,200],"leverages":[64],"outsourcing":[65],"through":[66],"carriers.":[68],"To":[69],"enable":[70],"re\u2010optimization,":[72],"novel":[74],"approximate":[75],"linear":[76],"programming":[77],"(ALP)":[78],"approach":[79,99],"introduced.":[81],"offers":[83],"pathway":[86],"for":[87],"addressing":[88],"problems":[91],"(VRPs)":[92],"considerations.":[96],"ALP":[98,118],"adapted":[101],"the":[103,113,127,138,161,164,169,177,192,201,216,228,232,240,254],"specific":[104,175],"structure":[105],"of":[106,115,130,137,148,163,213,256],"demands,":[110],"leading":[111],"development":[114],"decomposition\u2010based":[117],"solution":[119],"framework.":[120,259],"adaptation":[122],"arises":[123],"from":[124,145],"changes":[125],"in":[126,220,224],"decision":[128,140],"sequence":[129],"restocking":[133],"at":[134],"each":[135],"step":[136],"Markov":[139],"process":[141],"(MDP),":[142],"which":[143],"differs":[144],"previous":[146],"formulations":[147],"Additionally,":[154],"further":[155],"adaptations":[156],"made":[158],"facilitate":[160],"computation":[162],"proposed":[165,202,241],"by":[167,183],"exploring":[168],"relationships":[170],"among":[171],"variables":[172],"constraints":[174],"context,":[179],"as":[180,182],"well":[181],"developing":[184],"constraint":[186],"sampling":[187],"procedure":[188],"designed":[189],"mimic":[191],"near\u2010optimal":[193],"heuristic":[194],"policy.":[195],"Our":[196],"numerical":[197],"results":[198],"show":[199],"outsourcing\u2010based":[203],"policy":[204,230,244],"yields":[205],"notable":[206],"operating\u2010cost":[207],"savings,":[208],"an":[210],"average":[211],"improvement":[212],"4.06%":[214],"over":[215,249],"traditional":[217,233],"midpoint\u2010depot":[221],"instances.":[222],"Moreover,":[223],"small":[225],"instances":[226],"where":[227],"optimal":[229],"within":[231],"partial":[234],"framework":[236],"can":[237],"be":[238],"computed,":[239],"price\u2010directed":[242],"(PD)":[243],"still":[245],"provides":[246],"cost":[247],"advantages":[248],"this":[250],"scheme,":[252],"demonstrating":[253],"value":[255],"our":[257],"ALP\u2010based":[258]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-31T00:00:00"}