{"id":"https://openalex.org/W4415250761","doi":"https://doi.org/10.1109/hpec67600.2025.11196671","title":"Multi-Stage Stochastic Programming for Heavy-Duty Electric Truck Routing Under Public Charging Congestion Uncertainty","display_name":"Multi-Stage Stochastic Programming for Heavy-Duty Electric Truck Routing Under Public Charging Congestion Uncertainty","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250761","doi":"https://doi.org/10.1109/hpec67600.2025.11196671"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-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/A5100605489","display_name":"Ziyan Li","orcid":"https://orcid.org/0000-0002-0114-4968"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ziyan Li","raw_affiliation_strings":["Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115491740","display_name":"Nikolay Aristov","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolay Aristov","raw_affiliation_strings":["Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Antoine Germain","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antoine Germain","raw_affiliation_strings":["Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050654045","display_name":"Elenna Dugundji","orcid":"https://orcid.org/0000-0001-9277-9485"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elenna R. Dugundji","raw_affiliation_strings":["Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Center for Transportation and Logistics,Cambridge,MA,USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100605489"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28088767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10768","display_name":"Electric Vehicles and Infrastructure","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10768","display_name":"Electric Vehicles and Infrastructure","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9930999875068665,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9585000276565552,"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/solver","display_name":"Solver","score":0.6169999837875366},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5942999720573425},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.555899977684021},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5375000238418579},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5218999981880188},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4611999988555908},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.4560999870300293},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44830000400543213},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44200000166893005},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43160000443458557}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.703000009059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6262000203132629},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6169999837875366},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5942999720573425},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.555899977684021},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5375000238418579},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4611999988555908},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44830000400543213},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44200000166893005},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43160000443458557},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.41290000081062317},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.34209999442100525},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2872999906539917},{"id":"https://openalex.org/C2776422217","wikidata":"https://www.wikidata.org/wiki/Q13629441","display_name":"Electric vehicle","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2019710194","https://openalex.org/W2790253573","https://openalex.org/W2883672905","https://openalex.org/W2972680096","https://openalex.org/W2980740617","https://openalex.org/W2989947400","https://openalex.org/W3006280918","https://openalex.org/W3082883806","https://openalex.org/W3104464976","https://openalex.org/W3154344835","https://openalex.org/W4210713853","https://openalex.org/W4285162310","https://openalex.org/W4311351194","https://openalex.org/W4321380801","https://openalex.org/W4321460198","https://openalex.org/W4384080806","https://openalex.org/W4385736039","https://openalex.org/W4388479280"],"related_works":[],"abstract_inverted_index":{"This":[0],"study":[1],"explores":[2],"multi-stage":[3,27],"stochastic":[4],"optimization":[5],"frameworks":[6],"for":[7],"routing":[8,48],"heavy-duty":[9],"electric":[10],"trucks":[11],"making":[12],"long-haul":[13],"deliveries,":[14],"while":[15],"dealing":[16],"with":[17,58,94,185,198],"uncertainty":[18],"in":[19,29,37,139,216],"public":[20,62,151],"charging":[21,35,63,152],"station":[22],"congestion.":[23],"We":[24,154,196],"examine":[25],"a":[26,38,46,55,134,168,192],"problem":[28],"which":[30],"multiple":[31],"vehicles":[32],"share":[33],"limited":[34],"resources":[36],"dynamic":[39],"environment.":[40],"Each":[41],"decision":[42],"stage":[43],"corresponds":[44],"to":[45,143,182],"distinct":[47],"event,":[49],"such":[50],"as":[51,76],"the":[52,72,95,202,207],"arrival":[53],"at":[54,61],"delivery":[56,147],"location,":[57],"congestion":[59],"levels":[60],"stations":[64],"progressively":[65],"revealed.":[66],"The":[67],"key":[68],"state":[69],"variable":[70],"is":[71],"vehicle\u2019s":[73],"position,":[74],"represented":[75],"integer":[77,111],"indices":[78],"based":[79],"on":[80,133],"predefined":[81],"route":[82,85],"sequences.":[83],"These":[84],"sequences":[86],"introduce":[87],"global":[88],"constraints":[89],"that":[90,174],"must":[91],"be":[92],"reconciled":[93],"stage-wise":[96],"independence":[97],"assumption.To":[98],"solve":[99],"this":[100],"integer-state":[101,214],"problem,":[102],"we":[103],"compare":[104],"two":[105],"decomposition":[106],"algorithms:":[107],"Stochastic":[108,119],"Dual":[109,120],"Dynamic":[110,121],"Programming":[112,122],"(SDDiP)":[113],"using":[114,124],"strengthened":[115],"Benders\u2019":[116],"cuts":[117,212,215],"and":[118,149,160,188,204],"(SDDP)":[123],"piecewise":[125],"linear":[126,208],"Bellman":[127],"cuts.":[128],"Computational":[129],"experiments":[130],"are":[131],"conducted":[132],"realistic":[135],"mid-mile":[136],"transportation":[137],"network":[138,165],"California,":[140],"featuring":[141],"up":[142,181],"15":[144],"vehicles,":[145],"169":[146],"nodes":[148],"25":[150],"stations.":[153],"evaluate":[155],"computational":[156],"time,":[157],"convergence":[158,194],"behavior":[159],"policy":[161,190],"performance":[162],"across":[163],"varying":[164],"scales.":[166],"On":[167],"5-vehicle":[169],"instance,":[170],"our":[171],"results":[172],"show":[173],"SDDP":[175],"reduces":[176],"runtime":[177],"per":[178],"iteration":[179],"by":[180],"17.22%":[183],"compared":[184],"SDDiP":[186],"solver":[187],"delivers":[189],"within":[191],"2.90%":[193],"gap.":[195],"conclude":[197],"practical":[199],"insights":[200],"regarding":[201],"scalability":[203],"stability":[205],"of":[206],"programming":[209],"relaxation":[210],"(LP-relaxation)":[211],"versus":[213],"large-scale":[217],"Electric":[218],"Vehicle":[219],"Routing":[220],"Problem":[221],"(EVRP)":[222],"applications.":[223]},"counts_by_year":[],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-16T00:00:00"}