{"id":"https://openalex.org/W7157316587","doi":"https://doi.org/10.48550/arxiv.2604.24043","title":"A2DEPT: Large Language Model-Driven Automated Algorithm Design via Evolutionary Program Trees","display_name":"A2DEPT: Large Language Model-Driven Automated Algorithm Design via Evolutionary Program Trees","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7157316587","doi":"https://doi.org/10.48550/arxiv.2604.24043"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.24043","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24043","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.2604.24043","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134811226","display_name":"Bin Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134802762","display_name":"Shouliang Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhu, Shouliang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124230999","display_name":"Beidan Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Beidan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134819849","display_name":"Yong Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134809727","display_name":"Tianle Pu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pu, Tianle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134752188","display_name":"Huichun Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Huichun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134804265","display_name":"Zhengqiu Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhu, Zhengqiu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.3928000032901764,"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.3928000032901764,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.12300000339746475,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.037700001150369644,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.7172999978065491},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6118999719619751},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5364000201225281},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5023999810218811},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4878999888896942},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47850000858306885},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4690000116825104},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4424999952316284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7422000169754028},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7172999978065491},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6118999719619751},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5364000201225281},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4878999888896942},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47850000858306885},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40560001134872437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33809998631477356},{"id":"https://openalex.org/C82714645","wikidata":"https://www.wikidata.org/wiki/Q438331","display_name":"Template","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2985000014305115},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27959999442100525},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.24043","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24043","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.2604.24043","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24043","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Designing":[0],"heuristics":[1],"for":[2],"combinatorial":[3],"optimization":[4],"problems":[5],"(COPs)":[6],"is":[7],"a":[8,97,122],"fundamental":[9],"yet":[10],"challenging":[11],"task":[12],"that":[13,126],"traditionally":[14],"requires":[15],"extensive":[16],"domain":[17],"expertise.":[18],"Recently,":[19],"Large":[20],"Language":[21],"Model":[22],"(LLM)-based":[23],"Automated":[24,75],"Heuristic":[25],"Design":[26,77],"(AHD)":[27],"has":[28],"shown":[29],"promise":[30],"in":[31],"autonomously":[32],"generating":[33],"heuristic":[34],"components":[35],"with":[36,101,121],"minimal":[37],"human":[38],"intervention.":[39],"However,":[40],"most":[41],"existing":[42],"LLM-based":[43,136],"AHD":[44,163],"methods":[45],"enforce":[46,119],"fixed":[47],"algorithmic":[48,63],"templates":[49],"to":[50,57,159],"ensure":[51],"executability,":[52],"which":[53,83],"confines":[54],"the":[55,92,146,151,160],"search":[56,100],"component-level":[58],"tuning":[59],"and":[60,104,141],"limits":[61],"system-level":[62,87],"expressiveness.":[64],"To":[65,113],"enable":[66],"open-ended":[67,115],"solver":[68],"synthesis":[69],"beyond":[70],"rigid":[71],"templates,":[72],"we":[73,118],"propose":[74],"Algorithm":[76],"via":[78,96],"Evolutionary":[79],"Program":[80],"Trees":[81],"(A2DEPT),":[82],"treats":[84],"LLMs":[85],"as":[86],"algorithm":[88],"architects.":[89],"A2DEPT":[90,132],"explores":[91],"vast":[93],"program":[94],"space":[95],"tree-structured":[98],"evolutionary":[99],"hybrid":[102],"selection":[103],"hierarchical":[105],"operators,":[106],"enabling":[107],"iterative":[108],"refinement":[109],"of":[110],"complete":[111],"algorithms.":[112],"make":[114],"generation":[116],"practical,":[117],"executability":[120],"lightweight":[123],"program-maintenance":[124],"loop":[125],"performs":[127],"feedback-driven":[128],"repair.":[129],"In":[130],"experiments,":[131],"consistently":[133],"outperforms":[134],"representative":[135],"baselines":[137],"on":[138],"both":[139],"standard":[140,147],"highly":[142],"constrained":[143],"benchmarks.":[144],"On":[145],"benchmarks,":[148],"it":[149],"reduces":[150],"mean":[152],"normalized":[153],"optimality":[154],"gap":[155],"by":[156],"9.8%":[157],"relative":[158],"strongest":[161],"competing":[162],"baseline.":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-29T00:00:00"}