{"id":"https://openalex.org/W7128513315","doi":"https://doi.org/10.48550/arxiv.2602.08253","title":"G-LNS: Generative Large Neighborhood Search for LLM-Based Automatic Heuristic Design","display_name":"G-LNS: Generative Large Neighborhood Search for LLM-Based Automatic Heuristic Design","publication_year":2026,"publication_date":"2026-02-09","ids":{"openalex":"https://openalex.org/W7128513315","doi":"https://doi.org/10.48550/arxiv.2602.08253"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.08253","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102001588","display_name":"Baoyun Zhao","orcid":"https://orcid.org/0000-0003-4140-0601"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhao, Baoyun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125489030","display_name":"He Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, He","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101796066","display_name":"Liang Zeng","orcid":"https://orcid.org/0000-0003-1369-1368"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zeng, Liang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102001588"],"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.3650999963283539,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.3650999963283539,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1687999963760376,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.038600001484155655,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/heuristics","display_name":"Heuristics","score":0.7832000255584717},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6367999911308289},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.47760000824928284},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.45210000872612},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.4498000144958496},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4494999945163727},{"id":"https://openalex.org/keywords/generative-model","display_name":"Generative model","score":0.42179998755455017},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.41780000925064087},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.41019999980926514}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7832000255584717},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6367999911308289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6103000044822693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48100000619888306},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.47760000824928284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4731999933719635},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.45210000872612},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.4498000144958496},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.42179998755455017},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41780000925064087},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.3977000117301941},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3783999979496002},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3098999857902527},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2770000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.08253","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.08253","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.08253","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:doi:10.48550/arxiv.2602.08253","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"While":[0],"Large":[1,78],"Language":[2],"Models":[3],"(LLMs)":[4],"have":[5],"recently":[6],"shown":[7],"promise":[8],"in":[9,53,89],"Automated":[10],"Heuristic":[11],"Design":[12],"(AHD),":[13],"existing":[14],"approaches":[15],"typically":[16],"formulate":[17],"AHD":[18,72,151],"around":[19],"constructive":[20],"priority":[21],"rules":[22],"or":[23],"parameterized":[24],"local":[25,51],"search":[26,31],"guidance,":[27],"thereby":[28],"restricting":[29],"the":[30,74,113],"space":[32],"to":[33,48,73,94],"fixed":[34],"heuristic":[35],"forms.":[36],"Such":[37],"designs":[38],"offer":[39],"limited":[40],"capacity":[41],"for":[42],"structural":[43,123],"exploration,":[44],"making":[45],"it":[46],"difficult":[47],"escape":[49],"deep":[50],"optima":[52],"complex":[54],"Combinatorial":[55],"Optimization":[56],"Problems":[57,137,143],"(COPs).":[58],"In":[59],"this":[60],"work,":[61],"we":[62],"propose":[63],"G-LNS,":[64],"a":[65],"generative":[66],"evolutionary":[67],"framework":[68],"that":[69,86,119,146],"extends":[70],"LLM-based":[71,150],"automated":[75],"design":[76],"of":[77,99,115],"Neighborhood":[79],"Search":[80],"(LNS)":[81],"operators.":[82,103],"Unlike":[83],"prior":[84],"methods":[85,152],"evolve":[87],"heuristics":[88,161],"isolation,":[90],"G-LNS":[91,147],"leverages":[92],"LLMs":[93],"co-evolve":[95],"tightly":[96],"coupled":[97],"pairs":[98],"destroy":[100],"and":[101,125,139,178],"repair":[102],"A":[104],"cooperative":[105],"evaluation":[106],"mechanism":[107],"explicitly":[108],"captures":[109],"their":[110],"interaction,":[111],"enabling":[112],"discovery":[114],"complementary":[116],"operator":[117],"logic":[118],"jointly":[120],"performs":[121],"effective":[122],"disruption":[124],"reconstruction.":[126],"Extensive":[127],"experiments":[128],"on":[129],"challenging":[130],"COP":[131],"benchmarks,":[132],"such":[133],"as":[134,153,155],"Traveling":[135],"Salesman":[136],"(TSP)":[138],"Capacitated":[140],"Vehicle":[141],"Routing":[142],"(CVRP),":[144],"demonstrate":[145],"significantly":[148],"outperforms":[149],"well":[154],"strong":[156],"classical":[157],"solvers.":[158],"The":[159],"discovered":[160],"not":[162],"only":[163],"achieve":[164],"near-optimal":[165],"solutions":[166],"with":[167],"reduced":[168],"computational":[169],"budgets":[170],"but":[171],"also":[172],"exhibit":[173],"robust":[174],"generalization":[175],"across":[176],"diverse":[177],"unseen":[179],"instance":[180],"distributions.":[181]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-11T00:00:00"}