{"id":"https://openalex.org/W7152086996","doi":"https://doi.org/10.48550/arxiv.2604.04940","title":"ReVEL: Multi-Turn Reflective LLM-Guided Heuristic Evolution via Structured Performance Feedback","display_name":"ReVEL: Multi-Turn Reflective LLM-Guided Heuristic Evolution via Structured Performance Feedback","publication_year":2026,"publication_date":"2026-03-05","ids":{"openalex":"https://openalex.org/W7152086996","doi":"https://doi.org/10.48550/arxiv.2604.04940"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04940","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04940","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.04940","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120703688","display_name":"Cuong Van Duc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van Duc, Cuong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120703689","display_name":"Minh Nguyen Dinh Tuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tuan, Minh Nguyen Dinh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133204305","display_name":"Tam Vu Duc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Duc, Tam Vu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107691933","display_name":"Tung Vu Duy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Duy, Tung Vu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133172554","display_name":"Son Nguyen Van","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van, Son Nguyen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133224283","display_name":"Hanh Nguyen Thi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thi, Hanh Nguyen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126473127","display_name":"Binh Huynh Thi Thanh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thanh, Binh Huynh Thi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.46059998869895935,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.46059998869895935,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.1615000069141388,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.04349999874830246,"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/heuristics","display_name":"Heuristics","score":0.8910999894142151},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7286999821662903},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4334000051021576},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.41670000553131104},{"id":"https://openalex.org/keywords/social-heuristics","display_name":"Social heuristics","score":0.4097999930381775},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.30309998989105225}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8910999894142151},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7286999821662903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6488999724388123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.436599999666214},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4334000051021576},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C139475501","wikidata":"https://www.wikidata.org/wiki/Q17081866","display_name":"Social heuristics","level":4,"score":0.4097999930381775},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37459999322891235},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33980000019073486},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3310000002384186},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.295199990272522},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26429998874664307},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04940","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04940","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.04940","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04940","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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Designing":[0],"effective":[1],"heuristics":[2,32,60,92],"for":[3,23,53,68,74],"NP-hard":[4],"combinatorial":[5,106],"optimization":[6,107,114],"problems":[7],"remains":[8],"challenging":[9],"and":[10,71,97,124],"often":[11],"requires":[12],"substantial":[13],"domain":[14],"expertise.":[15],"Recent":[16],"LLM-guided":[17,118],"evolutionary":[18,101,119],"methods":[19],"have":[20],"shown":[21],"promise":[22],"automated":[24],"heuristic":[25,56,141],"generation,":[26],"but":[27],"most":[28],"existing":[29,117],"approaches":[30],"refine":[31],"independently":[33],"or":[34],"through":[35],"limited":[36],"pairwise":[37],"feedback.":[38],"We":[39],"propose":[40],"ReVEL:":[41],"Multi-Turn":[42],"Reflective":[43],"LLM-Guided":[44],"Heuristic":[45],"Evolution":[46],"via":[47],"Structured":[48],"Performance":[49],"Feedback,":[50],"a":[51],"framework":[52],"group-wise":[54],"multi-turn":[55,84],"refinement.":[57],"ReVEL":[58,111],"organizes":[59],"into":[61],"behavior-aware":[62,131],"reflective":[63],"groups,":[64],"including":[65],"similarity-driven":[66],"groups":[67,73],"localized":[69],"refinement":[70,85,137],"diversity-driven":[72],"exploratory":[75],"search.":[76],"Within":[77],"each":[78],"group,":[79],"the":[80],"LLM":[81,125],"performs":[82],"iterative":[83,140],"using":[86],"accumulated":[87],"performance":[88,115],"feedback,":[89],"enabling":[90],"related":[91],"to":[93,134],"be":[94],"jointly":[95],"analyzed":[96],"progressively":[98],"improved":[99],"across":[100,121],"iterations.":[102],"Experiments":[103],"on":[104],"standard":[105],"benchmarks":[108],"show":[109],"that":[110,130],"generally":[112],"improves":[113],"over":[116],"baselines":[120],"multiple":[122],"settings":[123],"backbones.":[126],"Additional":[127],"analyses":[128],"suggest":[129],"grouping":[132],"contributes":[133],"more":[135],"consistent":[136],"trajectories":[138],"during":[139],"evolution.":[142]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-09T00:00:00"}