{"id":"https://openalex.org/W4400684999","doi":"https://doi.org/10.1287/opre.2023.0569","title":"Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios","display_name":"Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios","publication_year":2024,"publication_date":"2024-07-16","ids":{"openalex":"https://openalex.org/W4400684999","doi":"https://doi.org/10.1287/opre.2023.0569"},"language":"en","primary_location":{"id":"doi:10.1287/opre.2023.0569","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.2023.0569","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"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":"Operations Research","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/A5090909690","display_name":"Matheus J. Ota","orcid":"https://orcid.org/0000-0002-3730-6420"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Matheus J. Ota","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"],"raw_orcid":"https://orcid.org/0000-0002-3730-6420","affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040209225","display_name":"Ricardo Fukasawa","orcid":"https://orcid.org/0000-0001-8785-5906"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ricardo Fukasawa","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"],"raw_orcid":"https://orcid.org/0000-0001-8785-5906","affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090909690"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":1.1028,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77693256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"73","issue":"4","first_page":"2177","last_page":"2187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12176","display_name":"Optimization and Packing Problems","score":0.9811999797821045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6416201591491699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5653566122055054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47796034812927246},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47505733370780945},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.44871076941490173},{"id":"https://openalex.org/keywords/stage","display_name":"Stage (stratigraphy)","score":0.42064979672431946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21610280871391296},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15032896399497986},{"id":"https://openalex.org/keywords/geology","display_name":"Geology","score":0.11082252860069275}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6416201591491699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5653566122055054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47796034812927246},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47505733370780945},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.44871076941490173},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.42064979672431946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21610280871391296},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15032896399497986},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.11082252860069275},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/opre.2023.0569","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.2023.0569","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"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":"Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W311217234","https://openalex.org/W1569990960","https://openalex.org/W1752958389","https://openalex.org/W1965032790","https://openalex.org/W1988022841","https://openalex.org/W1995725694","https://openalex.org/W2011300857","https://openalex.org/W2023482164","https://openalex.org/W2042967365","https://openalex.org/W2043459466","https://openalex.org/W2066878540","https://openalex.org/W2086207137","https://openalex.org/W2091219277","https://openalex.org/W2111658959","https://openalex.org/W2143514150","https://openalex.org/W2157062061","https://openalex.org/W2499699449","https://openalex.org/W2524034199","https://openalex.org/W2559217904","https://openalex.org/W2611423960","https://openalex.org/W2873879056","https://openalex.org/W2914414140","https://openalex.org/W2946283300","https://openalex.org/W2953891001","https://openalex.org/W2997549357","https://openalex.org/W3020137299","https://openalex.org/W3034945320","https://openalex.org/W3037819751","https://openalex.org/W4252801674","https://openalex.org/W4281659534","https://openalex.org/W4308195387","https://openalex.org/W4309772413","https://openalex.org/W4320726898","https://openalex.org/W4376135420"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2157331354","https://openalex.org/W2626773395","https://openalex.org/W3131953714","https://openalex.org/W1966197055"],"abstract_inverted_index":{"On":[0],"the":[1,17,20,29,34,50,54,66,88,121,126,130,133,143,162,170],"Difficulty":[2],"of":[3,80,91,106,129,154,164],"Pricing":[4,107],"Routes":[5,108],"for":[6,14,65,109,150,169],"Stochastic":[7,111],"Vehicle":[8,112],"Routing":[9,113],"Problems":[10,114],"Many":[11],"approaches":[12],"exist":[13],"dealing":[15],"with":[16,24,115,124,172],"uncertainty":[18],"in":[19,101],"vehicle":[21,55],"routing":[22],"problem":[23,128,146],"stochastic":[25,39],"demands":[26,52,135],"(VRPSD),":[27],"but":[28],"most":[30],"popular":[31],"approach":[32],"models":[33],"VRPSD":[35,67,131,144,171],"as":[36],"a":[37,42,76,94,151],"two-stage":[38],"program":[40],"where":[41],"recourse":[43,155],"policy":[44],"prescribes":[45],"actions":[46],"that":[47,71,96,142],"handle":[48],"when":[49,132],"realized":[51],"exceed":[53],"capacity.":[56],"Similarly":[57],"to":[58],"other":[59],"VRP":[60],"variants,":[61],"some":[62,102],"state-of-the-art":[63],"algorithms":[64,168],"use":[68],"set-partitioning":[69],"formulations":[70],"generate":[72],"variables":[73],"(routes)":[74],"via":[75],"pricing":[77,127,145,167],"problem.":[78],"All":[79],"these":[81],"algorithms,":[82],"however,":[83],"have":[84],"strong":[85],"assumptions":[86],"on":[87],"probability":[89],"distribution":[90],"customer":[92,134],"demands,":[93],"simplification":[95],"might":[97],"not":[98],"be":[99],"realistic":[100],"applications.":[103],"In":[104],"\u201cHardness":[105],"Two-Stage":[110],"Scenarios,\u201d":[116],"Ota":[117],"and":[118,157],"Fukasawa":[119],"examine":[120],"challenges":[122],"associated":[123],"solving":[125],"are":[136],"given":[137],"by":[138],"scenarios.":[139],"They":[140],"demonstrate":[141],"is":[147],"strongly":[148],"NP-hard":[149],"wide":[152],"variety":[153],"policies":[156],"route":[158],"relaxations.":[159],"This":[160],"highlights":[161],"difficulty":[163],"developing":[165],"efficient":[166],"scenario-based":[173],"demand":[174],"models.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}