{"id":"https://openalex.org/W7130551202","doi":"https://doi.org/10.1287/trsc.2024.0752","title":"A Branch-and-Benders Cut Algorithm for a Stochastic Service Network Design with Crowdsourced Capacity","display_name":"A Branch-and-Benders Cut Algorithm for a Stochastic Service Network Design with Crowdsourced Capacity","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7130551202","doi":"https://doi.org/10.1287/trsc.2024.0752"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.2024.0752","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2024.0752","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092663165","display_name":"Ozgur Satici","orcid":"https://orcid.org/0000-0003-0178-9261"},"institutions":[{"id":"https://openalex.org/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ozgur Satici","raw_affiliation_strings":["Department of Information Systems, Statistics, and Management Science, Culverhouse College of Business, The University of Alabama, Tuscaloosa, Alabama 35487"],"raw_orcid":"https://orcid.org/0000-0003-0178-9261","affiliations":[{"raw_affiliation_string":"Department of Information Systems, Statistics, and Management Science, Culverhouse College of Business, The University of Alabama, Tuscaloosa, Alabama 35487","institution_ids":["https://openalex.org/I17301866"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018521336","display_name":"Iman Dayarian","orcid":"https://orcid.org/0000-0002-9179-1973"},"institutions":[{"id":"https://openalex.org/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Iman Dayarian","raw_affiliation_strings":["Department of Information Systems, Statistics, and Management Science, Culverhouse College of Business, The University of Alabama, Tuscaloosa, Alabama 35487"],"raw_orcid":"https://orcid.org/0000-0002-9179-1973","affiliations":[{"raw_affiliation_string":"Department of Information Systems, Statistics, and Management Science, Culverhouse College of Business, The University of Alabama, Tuscaloosa, Alabama 35487","institution_ids":["https://openalex.org/I17301866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018521336"],"corresponding_institution_ids":["https://openalex.org/I17301866"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14555596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":"2","first_page":"316","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.796500027179718,"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.796500027179718,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.04010000079870224,"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"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.028999999165534973,"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/benders-decomposition","display_name":"Benders' decomposition","score":0.675000011920929},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.5647000074386597},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5440999865531921},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5368000268936157},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5364999771118164},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5231999754905701},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5188999772071838},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4666000008583069},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4616999924182892}],"concepts":[{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.675000011920929},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.5647000074386597},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5440999865531921},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5368000268936157},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5293999910354614},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.5235000252723694},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5231999754905701},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5188999772071838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49410000443458557},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4666000008583069},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C2781007418","wikidata":"https://www.wikidata.org/wiki/Q1456934","display_name":"Capacity planning","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C191068436","wikidata":"https://www.wikidata.org/wiki/Q2145956","display_name":"Capacity management","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C181889124","wikidata":"https://www.wikidata.org/wiki/Q380204","display_name":"Service level","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.3368000090122223},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C120330832","wikidata":"https://www.wikidata.org/wiki/Q166656","display_name":"Supply and demand","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.3034999966621399},{"id":"https://openalex.org/C16051113","wikidata":"https://www.wikidata.org/wiki/Q828814","display_name":"Market share","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C58037377","wikidata":"https://www.wikidata.org/wiki/Q92785211","display_name":"Level of service","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.27570000290870667},{"id":"https://openalex.org/C32597650","wikidata":"https://www.wikidata.org/wiki/Q5255044","display_name":"Demand patterns","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C2777305159","wikidata":"https://www.wikidata.org/wiki/Q1430291","display_name":"Fleet management","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C13166094","wikidata":"https://www.wikidata.org/wiki/Q1597271","display_name":"Capacity utilization","level":2,"score":0.25119999051094055},{"id":"https://openalex.org/C2776613951","wikidata":"https://www.wikidata.org/wiki/Q7097788","display_name":"Operational planning","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/trsc.2024.0752","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2024.0752","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5725007057189941}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W1569990960","https://openalex.org/W1967113490","https://openalex.org/W2038426159","https://openalex.org/W2044121814","https://openalex.org/W2045699373","https://openalex.org/W2056200673","https://openalex.org/W2059796198","https://openalex.org/W2070423620","https://openalex.org/W2100387313","https://openalex.org/W2122222032","https://openalex.org/W2128178859","https://openalex.org/W2132673360","https://openalex.org/W2145507194","https://openalex.org/W2149307604","https://openalex.org/W2199523148","https://openalex.org/W2279897743","https://openalex.org/W2331159541","https://openalex.org/W2405230269","https://openalex.org/W2560324934","https://openalex.org/W2564296586","https://openalex.org/W2586852225","https://openalex.org/W2588399031","https://openalex.org/W2766978649","https://openalex.org/W2790253573","https://openalex.org/W2794530433","https://openalex.org/W2801732248","https://openalex.org/W2903903106","https://openalex.org/W2941075535","https://openalex.org/W2969571535","https://openalex.org/W2973520255","https://openalex.org/W2979300297","https://openalex.org/W2990631785","https://openalex.org/W3010739339","https://openalex.org/W3026955418","https://openalex.org/W3027448965","https://openalex.org/W3111102891","https://openalex.org/W3121728793","https://openalex.org/W3128540120","https://openalex.org/W3189209206","https://openalex.org/W3213233844","https://openalex.org/W4200391575","https://openalex.org/W4220995197","https://openalex.org/W4251167157","https://openalex.org/W4281290055","https://openalex.org/W4283767823","https://openalex.org/W4283779249","https://openalex.org/W4285028055","https://openalex.org/W4285544586","https://openalex.org/W4308862743","https://openalex.org/W4367675087","https://openalex.org/W4385988525","https://openalex.org/W4392401765","https://openalex.org/W4402483113"],"related_works":[],"abstract_inverted_index":{"We":[0,117,229],"explore":[1],"the":[2,19,55,68,75,84,89,92,98,103,110,119,122,147,155,175,196,221,226,231,238,241],"stochastic":[3,128,207],"service":[4,12],"network":[5],"design":[6],"problem":[7,120,129],"of":[8,27,46,170,177,198,216,233,240],"an":[9],"intracity":[10],"courier":[11,20,69,99],"provider.":[13],"To":[14,173],"efficiently":[15],"fulfill":[16],"delivery":[17],"tasks,":[18],"company":[21,70,100],"employs":[22],"a":[23,36,79,126,138,204,213],"hybrid":[24],"fleet":[25],"consisting":[26],"contracted":[28],"drivers,":[29],"crowdshippers,":[30],"and":[31,48,58,64,91,136,162,189,236],"third-party":[32],"drivers":[33],"based":[34],"on":[35],"planning":[37],"framework":[38],"that":[39,210],"takes":[40],"into":[41,60],"account":[42,61],"uncertainty":[43],"in":[44,133],"terms":[45],"demand":[47,63,90],"transportation":[49,72,105],"capacity":[50,66,73,95,106],"offered":[51],"by":[52,107,114],"crowdshippers.":[53,116],"At":[54,83],"tactical":[56,123],"level":[57,124],"taking":[59],"future":[62],"crowdshipper":[65,94],"estimations,":[67],"acquires":[71],"through":[74,109],"forward":[76],"market":[77,112],"at":[78,121,225,243],"relatively":[80],"low":[81],"rate.":[82],"operational":[85,227],"level,":[86],"however,":[87],"once":[88],"available":[93],"are":[96,247],"revealed,":[97],"may":[101],"supplement":[102],"existing":[104],"acquiring":[108],"spot":[111],"and/or":[113],"employing":[115],"model":[118],"as":[125,185],"two-stage":[127],"with":[130,140],"integer":[131,159],"variables":[132],"both":[134],"stages":[135],"develop":[137],"branch-and-Benders-cut":[139],"partial":[141],"Benders":[142,157,163],"decomposition":[143,165],"approach":[144,209],"to":[145,166,194],"solve":[146],"model.":[148],"In":[149],"our":[150,178],"solution":[151],"framework,":[152],"we":[153,180,202],"incorporate":[154],"classical":[156],"decomposition,":[158],"L-shaped":[160],"method,":[161,179],"dual":[164],"generate":[167],"different":[168],"types":[169],"optimality":[171],"cuts.":[172],"improve":[174],"efficiency":[176],"employ":[181],"accelerating":[182],"strategies":[183],"such":[184,234,245],"selective":[186],"subproblems,":[187],"parallelism,":[188],"[Formula:":[190],"see":[191],"text]-optimality.":[192],"Further,":[193],"study":[195],"effect":[197,239],"possible":[199],"plan":[200,218],"revisions,":[201],"propose":[203],"partially":[205],"adaptive":[206],"programming":[208],"allows":[211],"for":[212],"limited":[214],"number":[215],"tactical-level":[217],"adjustments":[219],"given":[220],"extra":[222],"information":[223],"revealed":[224],"phase.":[228],"quantify":[230],"benefits":[232],"updates":[235,246],"evaluate":[237],"frequencies":[242],"which":[244],"performed.":[248]},"counts_by_year":[],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2026-02-20T00:00:00"}