{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T20:50:15Z","timestamp":1775163015407,"version":"3.50.1"},"reference-count":228,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276100"],"award-info":[{"award-number":["62276100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017942","name":"Guangdong Provincial Natural Science Foundation for Outstanding Youth Team Project","doi-asserted-by":"publisher","award":["2024B1515040010"],"award-info":[{"award-number":["2024B1515040010"]}],"id":[{"id":"10.13039\/100017942","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Science and Technology Elite Talent Leading Program for Basic and Applied Basic Research","award":["SL2024A04J01361"],"award-info":[{"award-number":["SL2024A04J01361"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2025-00555463"],"award-info":[{"award-number":["RS-2025-00555463"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/tevc.2025.3568053","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T13:38:42Z","timestamp":1746711522000},"page":"667-687","source":"Crossref","is-referenced-by-count":4,"title":["Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6216-9379","authenticated-orcid":false,"given":"Zeyuan","family":"Ma","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, South China University of Technology, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8063-8984","authenticated-orcid":false,"given":"Hongshu","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, South China University of Technology, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5648-1160","authenticated-orcid":false,"given":"Yue-Jiao","family":"Gong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, South China University of Technology, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-9871","authenticated-orcid":false,"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6802-2463","authenticated-orcid":false,"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2950779"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.5539\/mas.v10n11p131"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2196800"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-21936-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.7.1527"},{"key":"ref7","volume-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"Salimans","year":"2017"},{"key":"ref8","volume-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016"},{"key":"ref9","volume-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"key":"ref12","volume-title":"Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization","author":"Liang","year":"2013"},{"key":"ref13","article-title":"Multiobjective optimization test instances for the CEC 2009 special session and competition","author":"Zhang","year":"2008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.05.005"},{"key":"ref15","volume-title":"Benchmark functions for the CEC\u20192010 special session and competition on large-scale global optimization","author":"Tang","year":"2007"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/math9080864"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref18","first-page":"2546","article-title":"Algorithms for hyper-parameter optimization","volume-title":"Proc. NeurIPS","author":"Bergstra"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"issue":"1","key":"ref20","first-page":"2475","article-title":"SMAC3: A versatile Bayesian optimization package for hyperparameter optimization","volume":"23","author":"Lindauer","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","first-page":"1","article-title":"A hyperheuristic approach to scheduling a sales summit","volume-title":"Proc. PATAT","author":"Cowling"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2160401"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2041061"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/21.286385"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014613"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2015956"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2475174"},{"key":"ref28","volume-title":"The CMA evolution strategy: A tutorial","author":"Hansen","year":"2016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557555"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900380"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870295"},{"key":"ref32","first-page":"1","article-title":"MetaBox: A benchmark platform for meta-black-box optimization with reinforcement learning","volume-title":"Proc. NeurIPS","author":"Ma"},{"key":"ref33","first-page":"1126","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. ICML","author":"Finn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321813"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101194"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04527-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3060811"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3653996"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107678"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2024.3374889"},{"key":"ref41","volume-title":"LLaMoCo: Instruction tuning of large language models for optimization code generation","author":"Ma et al","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3654393"},{"key":"ref43","volume-title":"Reinforced in-context black-box optimization","author":"Song et al","year":"2024"},{"key":"ref44","first-page":"1","article-title":"Learning to learn without gradient descent by gradient descent","volume-title":"Proc. ICML","author":"Chen"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-46147-8_22"},{"key":"ref46","volume-title":"GLHF: General learned evolutionary algorithm via hyper functions","author":"Li","year":"2024"},{"key":"ref47","volume-title":"Meta learning black-box population-based optimizers","author":"Gomes","year":"2021"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3583133.3595822"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590496"},{"key":"ref50","first-page":"4668","article-title":"Connecting large language models with evolutionary algorithms yields powerful prompt optimizers","volume-title":"Proc. ICLR","author":"Guo"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3654238"},{"key":"ref52","first-page":"1","article-title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","volume-title":"Proc. ICML","author":"Liu"},{"key":"ref53","first-page":"1","article-title":"OptiMUS: Scalable optimization modeling with (MI) LP solvers and large language models","volume-title":"Proc. ICML","author":"Teshnizi"},{"key":"ref54","volume-title":"R2 indicator and deep reinforcement learning enhanced adaptive multi-objective evolutionary algorithm","author":"Tahernezhad-Javazm","year":"2024"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121397"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3653995"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2025.3558354"},{"key":"ref58","volume-title":"Learning to transfer for evolutionary multitasking","author":"Wu et al","year":"2024"},{"key":"ref59","volume-title":"Advancing automated knowledge transfer in evolutionary multitasking via large language models","author":"Huang","year":"2024"},{"key":"ref60","first-page":"1","article-title":"Automated design of metaheuristic algorithms: A survey","volume":"2024","author":"Zhao","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref61","volume-title":"Evolutionary computation in the era of large language model: Survey and roadmap","author":"Wu","year":"2024"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_17"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.03.011"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.5220\/0011954300003488"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101517"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2024.3443913"},{"key":"ref67","article-title":"Reinforcement learning: An introduction","volume-title":"A Bradford Book","author":"Sutton","year":"2018"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5529-2_1"},{"key":"ref69","article-title":"Evolutionary principles in self-referential learning, or on learning how to learn: the meta-meta-\u00b7 \u00b7 \u00b7 hook","author":"Schmidhuber","year":"1987"},{"key":"ref70","volume-title":"On the optimization of a synaptic learning rule","author":"Bengio","year":"2013"},{"key":"ref71","volume-title":"Neural architecture search with reinforcement learning","author":"Zoph","year":"2016"},{"key":"ref72","first-page":"3981","article-title":"Learning to learn by gradient descent by gradient descent","volume-title":"Proc. NeurIPS","author":"Andrychowicz"},{"key":"ref73","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. ICLR","author":"Kool"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_17"},{"key":"ref76","volume-title":"A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems","author":"Fang","year":"1993"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"ref78","first-page":"4118","article-title":"Towards insightful algorithm selection for optimization using meta-learning concepts","volume-title":"Proc. IJCNN","author":"Smith-Miles"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2011.153"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI44817.2019.9003018"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.10.036"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2020.3022339"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109751"},{"key":"ref84","first-page":"5235","article-title":"Large language model-enhanced algorithm selection: Towards comprehensive algorithm representation","volume-title":"Proc. IJCAI","author":"Wu"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/CSCWD61410.2024.10580058"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3654191"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.006"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/s13748-018-0155-7"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790035"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.06.010"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_48"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106693"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/j.egyr.2021.01.096"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/3508546.3508599"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107464"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1867120"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.04.053"},{"key":"ref98","first-page":"1","article-title":"Multi-agent dynamic algorithm configuration","volume-title":"Proc. NeurIPS","author":"Xue"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107731"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3146882"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-8082-3_3"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101274"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2022.3222057"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2023.3251441"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-023-01012-8"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.3934\/mbe.2023373"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-023-01243-9"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110801"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119672"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101387"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3244331"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101351"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107817"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123150"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3654185"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-023-2252-9"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101568"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101486"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-62922-8_2"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654062"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34904"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2025.3541587"},{"key":"ref123","first-page":"1","article-title":"Reinforcement learning-based self-adaptive differential evolution through automated landscape feature learning","volume-title":"Proc. GECCO","author":"Guo"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1145\/3712256.3726316"},{"key":"ref125","volume-title":"Advancing CMA-ES with learning-based cooperative coevolution for scalable optimization","author":"Guo","year":"2025"},{"key":"ref126","first-page":"1","article-title":"Meta-learning of black-box solvers using deep reinforcement learning","volume-title":"Proc. NeurIPS","author":"Chaybouti"},{"key":"ref127","first-page":"9","article-title":"Large language models as optimizers","volume-title":"Proc. ICLR","author":"Yang"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10611913"},{"key":"ref129","volume-title":"Large language model for multi-objective evolutionary optimization","author":"Liu et al","year":"2023"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-3814-8_11"},{"key":"ref131","volume-title":"Towards optimizing with large language models","author":"Guo","year":"2023"},{"key":"ref132","volume-title":"B2Opt: Learning to optimize black-box optimization with little budget","author":"Li","year":"2023"},{"key":"ref133","volume-title":"Large language model-based evolutionary optimizer: Reasoning with elitism","author":"Brahmachary","year":"2024"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-5581-3_18"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3197298"},{"key":"ref136","volume-title":"Algorithm evolution using large language model","author":"Liu","year":"2023"},{"key":"ref137","first-page":"1","article-title":"SYMBOL: Generating flexible black-box optimizers through symbolic equation learning","volume-title":"Proc. ICLR","author":"Chen"},{"key":"ref138","volume-title":"LLaMEA: A large language model evolutionary algorithm for automatically generating metaheuristics","author":"van Stein","year":"2024"},{"key":"ref139","volume-title":"Autonomous multi-objective optimization using large language model","author":"Huang","year":"2024"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70068-2_12"},{"key":"ref141","volume-title":"Automated metaheuristic algorithm design with autoregressive learning","author":"Zhao","year":"2024"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"ref143","volume-title":"A survey of meta-features used for automated selection of algorithms for black-box single-objective continuous optimization","author":"Cenikj","year":"2024"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330209"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00236"},{"key":"ref147","article-title":"Landscape analysis and heuristic search for multi-objective optimization","author":"Liefooghe","year":"2022"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459353"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-56852-7_7"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14714-2_4"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870222"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"ref156","first-page":"11","article-title":"PS-AAS: Portfolio selection for automated algorithm selection in black-box optimization","volume-title":"Proc. AutoML","author":"Kostovska"},{"key":"ref157","first-page":"10","article-title":"HPOBench: A collection of reproducible multi-fidelity benchmark problems for HPO","volume-title":"Proc. NeurIPS","author":"Eggensperger"},{"key":"ref158","article-title":"Adaptive operator selection for optimization","author":"Fialho","year":"2010"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13922"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504792"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504782"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185577"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3033593"},{"key":"ref164","first-page":"356","article-title":"The roles of mutation, inbreeding, crossbreeding, and selection in evolution","volume-title":"Proc. VI Int. Congr. Genetr.","author":"Wright"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590417"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3102863"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_5"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1109\/ssci52147.2023.10372008"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.011"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.03.014"},{"key":"ref171","first-page":"1","article-title":"Input warping for Bayesian optimization of non-stationary functions","volume-title":"Proc. ICML","author":"Snoek"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.52202\/075280-1396"},{"key":"ref173","volume-title":"Rethinking the role of demonstrations: What makes in-context learning work?","author":"Min","year":"2022"},{"issue":"1","key":"ref174","first-page":"13","article-title":"Meta-genetic programming: Co-evolving the operators of variation","volume":"9","author":"Edmonds","year":"2001","journal-title":"Turkish J. Elect. Eng. Comput. Sci."},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1145\/2330784.2330796"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2002052"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2482728"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504896"},{"key":"ref181","volume-title":"Playing Atari with deep reinforcement learning","author":"Mnih","year":"2013"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794127"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref185","first-page":"1729","article-title":"Actor\u2013critic algorithms","volume-title":"Proc. NeurIPS","author":"Konda"},{"key":"ref186","volume-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-023-04574-9"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(90)90086-O"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1808977"},{"key":"ref190","first-page":"1729","article-title":"Regret minimization in games with incomplete information","volume-title":"Proc. NeurIPS","author":"Zinkevich"},{"key":"ref191","first-page":"1","article-title":"End-to-end meta-Bayesian optimization with transformer neural processes","volume-title":"Proc. NeurIPS","author":"Maraval"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref193","volume-title":"Eureka: Human-level reward design via coding large language models","author":"Ma","year":"2023"},{"key":"ref194","volume-title":"Problem definitions and evaluation criteria for the CEC 2021 special session and competition on single objective bound constrained numerical optimization","author":"Mohamed","year":"2021"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3321996"},{"key":"ref196","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.861417"},{"key":"ref197","volume-title":"Benchmark functions for CEC\u20192013 special session and competition on Niching methods for multimodal function optimization","author":"Li","year":"2013"},{"key":"ref198","article-title":"Benchmark generator for CEC 2009 competition on dynamic optimization","author":"Li et al","year":"2008"},{"key":"ref199","article-title":"Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization","author":"Li","year":"2013"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00262"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.1145\/3673908"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09584-4_4"},{"key":"ref203","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100693"},{"key":"ref204","volume-title":"IOHprofiler: A benchmarking and profiling tool for iterative optimization heuristics","author":"Doerr","year":"2018"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref206","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015059928466"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1145\/3583133.3590697"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001690"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.1162\/1063656054088549"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4983112"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.5013\/ijssst.a.12.02.05"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144085"},{"key":"ref213","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_76"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_22"},{"key":"ref215","article-title":"Real-parameter black-box optimization benchmarking 2010: Experimental setup","author":"Hansen","year":"2010"},{"key":"ref216","article-title":"Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization","author":"Suganthan","year":"2005"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504739"},{"key":"ref218","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30229-9_27"},{"key":"ref219","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-016-0043-6"},{"key":"ref220","volume-title":"A survey on multi-task learning","author":"Zhang","year":"2021"},{"key":"ref221","volume-title":"Deep-ELA: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and multi-objective continuous optimization problems","author":"Seiler","year":"2024"},{"key":"ref222","volume-title":"Neural exploratory landscape analysis","author":"Ma","year":"2024"},{"key":"ref223","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3170638"},{"key":"ref224","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3338693"},{"key":"ref225","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654063"},{"key":"ref226","first-page":"1","article-title":"Position: Leverage foundational models for black-box optimization","volume-title":"Proc. ICML","author":"Song"},{"key":"ref227","first-page":"1","article-title":"GSM-symbolic: Understanding the limitations of mathematical reasoning in large language models","volume-title":"Proc. ICLR","author":"Mirzadeh"},{"key":"ref228","volume-title":"Training and evaluating language models with template-based data generation","author":"Zhang","year":"2024"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11466352\/10993463.pdf?arnumber=10993463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:50:16Z","timestamp":1775159416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10993463\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":228,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2025.3568053","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}