{"id":"https://openalex.org/W7124137605","doi":"https://doi.org/10.48550/arxiv.2601.07948","title":"Reinforcement Learning Methods for Neighborhood Selection in Local Search","display_name":"Reinforcement Learning Methods for Neighborhood Selection in Local Search","publication_year":2026,"publication_date":"2026-01-12","ids":{"openalex":"https://openalex.org/W7124137605","doi":"https://doi.org/10.48550/arxiv.2601.07948"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.07948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07948","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.07948","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5095094737","display_name":"Yannick Molinghen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Molinghen, Yannick","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122995598","display_name":"Augustin Delecluse","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Delecluse, Augustin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047309665","display_name":"Renaud De Landtsheer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"De Landtsheer, Renaud","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067707883","display_name":"Stefano Michelini","orcid":"https://orcid.org/0000-0002-8991-9771"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michelini, Stefano","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5095094737"],"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.26980000734329224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.26980000734329224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.19830000400543213,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.09040000289678574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.9176999926567078},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4867999851703644},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46480000019073486},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.42980000376701355},{"id":"https://openalex.org/keywords/learning-classifier-system","display_name":"Learning classifier system","score":0.428600013256073},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.423799991607666},{"id":"https://openalex.org/keywords/reinforcement","display_name":"Reinforcement","score":0.36250001192092896},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.35040000081062317}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.9176999926567078},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6564000248908997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6327000260353088},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5246000289916992},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4867999851703644},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46480000019073486},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C199190896","wikidata":"https://www.wikidata.org/wiki/Q3509276","display_name":"Learning classifier system","level":3,"score":0.428600013256073},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C67203356","wikidata":"https://www.wikidata.org/wiki/Q1321905","display_name":"Reinforcement","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2922999858856201},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.2533999979496002},{"id":"https://openalex.org/C196340769","wikidata":"https://www.wikidata.org/wiki/Q7698910","display_name":"Temporal difference learning","level":3,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.07948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07948","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.07948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07948","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.7398998737335205,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reinforcement":[0],"learning":[1,48,109,139,163],"has":[2],"recently":[3],"gained":[4],"traction":[5],"as":[6],"a":[7,30,146],"means":[8],"to":[9,95,104],"improve":[10],"combinatorial":[11],"optimization":[12],"methods,":[13],"yet":[14],"its":[15],"effectiveness":[16],"within":[17],"local":[18,165],"search":[19],"metaheuristics":[20],"specifically":[21],"remains":[22],"comparatively":[23],"underexamined.":[24],"In":[25,131],"this":[26],"study,":[27],"we":[28],"evaluate":[29],"range":[31],"of":[32,136,160],"reinforcement":[33,47,138,162],"learning-based":[34],"neighborhood":[35],"selection":[36],"strategies":[37],"--":[38,56],"multi-armed":[39],"bandits":[40],"(upper":[41],"confidence":[42],"bound,":[43],"$\u03b5$-greedy)":[44],"and":[45,57,73,79,107,156],"deep":[46,54,137,161],"methods":[49],"(proximal":[50],"policy":[51],"optimization,":[52],"double":[53],"$Q$-network)":[55],"compare":[58],"them":[59,143],"against":[60],"multiple":[61],"baselines":[62],"across":[63,120],"three":[64],"different":[65],"problems:":[66],"the":[67,71,80,128,133,154,157],"traveling":[68],"salesman":[69],"problem,":[70],"pickup":[72],"delivery":[74],"problem":[75],"with":[76,145],"time":[77],"windows,":[78],"car":[81],"sequencing":[82],"problem.":[83],"We":[84],"show":[85],"how":[86],"search-specific":[87],"characteristics,":[88],"particularly":[89],"large":[90],"variations":[91],"in":[92,164],"cost":[93],"due":[94],"constraint":[96],"violation":[97],"penalties,":[98],"necessitate":[99],"carefully":[100],"designed":[101],"reward":[102],"functions":[103],"provide":[105],"stable":[106],"informative":[108],"signals.":[110],"Our":[111],"extensive":[112],"experiments":[113],"reveal":[114],"that":[115,123],"algorithm":[116],"performance":[117],"varies":[118],"substantially":[119,147],"problems,":[121],"although":[122],"$\u03b5$-greedy":[124],"consistently":[125],"ranks":[126],"among":[127],"best":[129],"performers.":[130],"contrast,":[132],"computational":[134],"overhead":[135],"approaches":[140],"only":[141],"makes":[142],"competitive":[144],"longer":[148],"runtime.":[149],"These":[150],"findings":[151],"highlight":[152],"both":[153],"promise":[155],"practical":[158],"limitations":[159],"search.":[166]},"counts_by_year":[],"updated_date":"2026-01-15T23:21:31.212559","created_date":"2026-01-15T00:00:00"}