{"id":"https://openalex.org/W7130396377","doi":"https://doi.org/10.48550/arxiv.2602.15554","title":"Efficient Road Renovation Scheduling under Uncertainty using Lower Bound Pruning","display_name":"Efficient Road Renovation Scheduling under Uncertainty using Lower Bound Pruning","publication_year":2026,"publication_date":"2026-02-17","ids":{"openalex":"https://openalex.org/W7130396377","doi":"https://doi.org/10.48550/arxiv.2602.15554"},"language":"en","primary_location":{"id":"pmh:oai:ris.utwente.nl:openaire/0acc6544-9665-4a46-977e-5e80e6b185a6","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/0acc6544-9665-4a46-977e-5e80e6b185a6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bosch, R, Rogetzer, P, van Heeswijk, W & Mes, M 2026 'Efficient Road Renovation Scheduling under Uncertainty using Lower Bound Pruning' ArXiv.org. https://doi.org/10.48550/arXiv.2602.15554","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/0acc6544-9665-4a46-977e-5e80e6b185a6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006259649","display_name":"Robbert Bosch","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bosch, Robbert","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019934695","display_name":"Patricia Rogetzer","orcid":"https://orcid.org/0000-0001-9582-6320"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rogetzer, Patricia","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043700615","display_name":"Wouter van Heeswijk","orcid":"https://orcid.org/0000-0002-5413-9660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Heeswijk, Wouter","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005906246","display_name":"Martijn Mes","orcid":"https://orcid.org/0000-0001-9676-5259"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mes, Martijn","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006259649"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.8535000085830688,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.8535000085830688,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03139999881386757,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.01360000018030405,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6822999715805054},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6129000186920166},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4691999852657318},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4489000141620636},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.39079999923706055},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.38339999318122864}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6822999715805054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195999979972839},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6129000186920166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.544700026512146},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.39079999923706055},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.2888000011444092},{"id":"https://openalex.org/C24090081","wikidata":"https://www.wikidata.org/wiki/Q1043452","display_name":"Preventive maintenance","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25459998846054077},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ris.utwente.nl:openaire/0acc6544-9665-4a46-977e-5e80e6b185a6","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/0acc6544-9665-4a46-977e-5e80e6b185a6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bosch, R, Rogetzer, P, van Heeswijk, W & Mes, M 2026 'Efficient Road Renovation Scheduling under Uncertainty using Lower Bound Pruning' ArXiv.org. https://doi.org/10.48550/arXiv.2602.15554","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2602.15554","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15554","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/0acc6544-9665-4a46-977e-5e80e6b185a6","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/0acc6544-9665-4a46-977e-5e80e6b185a6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bosch, R, Rogetzer, P, van Heeswijk, W & Mes, M 2026 'Efficient Road Renovation Scheduling under Uncertainty using Lower Bound Pruning' ArXiv.org. https://doi.org/10.48550/arXiv.2602.15554","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[{"score":0.5034230947494507,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Urban":[0],"infrastructure":[1,90,110],"degrades":[2],"over":[3],"time,":[4],"necessitating":[5],"periodic":[6],"renovation":[7,14,91],"to":[8,27,135,178,182],"maintain":[9],"functionality":[10],"and":[11,65],"safety.":[12],"When":[13],"is":[15],"delayed":[16],"beyond":[17],"the":[18,97,149,163],"infrastructure's":[19],"remaining":[20],"lifespan,":[21],"costly":[22],"emergency":[23,36],"interventions":[24],"become":[25],"necessary":[26],"prevent":[28],"failure.":[29],"Decision":[30],"makers":[31],"must":[32],"therefore":[33],"balance":[34],"expected":[35],"intervention":[37],"costs":[38],"against":[39],"traffic":[40],"congestion":[41],"impacts.":[42],"We":[43,95,116,147],"formalize":[44],"this":[45,75],"trade-off":[46],"as":[47,99],"a":[48,78,100,118,131],"road":[49],"network":[50],"maintenance":[51],"scheduling":[52,92],"problem":[53,98,104,155],"with":[54,85,130],"uncertain":[55,109],"deadlines,":[56],"which":[57],"presents":[58],"optimization":[59,80,103],"challenges":[60],"including":[61],"computationally":[62],"expensive":[63],"evaluation":[64,122],"an":[66],"exponentially":[67],"growing":[68],"solution":[69,137],"space.":[70],"To":[71],"address":[72],"these":[73],"challenges,":[74],"paper":[76],"contributes":[77],"hybrid":[79],"approach":[81],"combining":[82],"machine":[83,126],"learning":[84,127],"genetic":[86,133],"algorithms":[87],"for":[88,108],"large-scale":[89],"under":[93],"uncertainty.":[94],"formulate":[96],"bi-level":[101],"multi-objective":[102,132],"that":[105,124],"explicitly":[106],"accounts":[107],"lifespans":[111],"through":[112],"probabilistic":[113],"failure":[114],"models.":[115],"develop":[117],"progressive":[119],"lower":[120],"bound":[121],"method":[123],"integrates":[125],"surrogate":[128],"models":[129],"algorithm":[134],"improve":[136],"quality":[138],"by":[139,173],"enabling":[140],"more":[141],"iterations":[142],"within":[143],"fixed":[144],"computational":[145,175],"budgets.":[146],"demonstrate":[148],"method's":[150],"effectiveness":[151],"on":[152],"substantially":[153],"larger":[154],"instances":[156],"(76":[157],"projects)":[158],"than":[159],"previously":[160],"addressed":[161],"in":[162],"literature,":[164],"achieving":[165],"statistically":[166],"significant":[167],"improvements":[168],"across":[169],"multiple":[170],"performance":[171],"metrics":[172],"increasing":[174],"efficiency":[176],"up":[177],"40":[179],"times":[180],"compared":[181],"standard":[183],"approaches.":[184]},"counts_by_year":[],"updated_date":"2026-02-22T15:27:11.003080","created_date":"2026-02-19T00:00:00"}