{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T04:47:25Z","timestamp":1785818845145,"version":"3.56.0"},"reference-count":129,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"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":"crossref","award":["62276100"],"award-info":[{"award-number":["62276100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Provincial Natural Science Foundation for Outstanding Youth Team Project","award":["2024B1515040010"],"award-info":[{"award-number":["2024B1515040010"]}]},{"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\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2025ZYGXZR027"],"award-info":[{"award-number":["2025ZYGXZR027"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Research Foundation Singapore through AI Singapore Programme","award":["AISG3-RPGV-2025-017"],"award-info":[{"award-number":["AISG3-RPGV-2025-017"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tevc.2026.3656374","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:40:17Z","timestamp":1768941617000},"page":"1390-1404","source":"Crossref","is-referenced-by-count":5,"title":["LLaMoCo: Instruction Tuning of Large Language Models for Optimization Code Generation"],"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":"South China University of Technology","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5648-1160","authenticated-orcid":false,"given":"Yue-Jiao","family":"Gong","sequence":"additional","affiliation":[{"name":"South China University of Technology","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8063-8984","authenticated-orcid":false,"given":"Hongshu","family":"Guo","sequence":"additional","affiliation":[{"name":"South China University of Technology","place":["Guangzhou, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7539-6156","authenticated-orcid":false,"given":"Jiacheng","family":"Chen","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong","place":["Hong Kong, China"],"department":["Department of Computer Science and Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6639-8547","authenticated-orcid":false,"given":"Yining","family":"Ma","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology","place":["Cambridge, MA, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4499-759X","authenticated-orcid":false,"given":"Zhiguang","family":"Cao","sequence":"additional","affiliation":[{"name":"Singapore Management University","place":["Tampines, Singapore"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-9871","authenticated-orcid":false,"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nankai University","place":["Tianjin, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1115\/DETC2006-99412"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975604"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11023-020-09548-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1108\/LHTN-01-2023-0009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10439-023-03172-7"},{"key":"ref7","article-title":"OptiMUS: Optimization modeling using MIP solvers and large language models","author":"AhmadiTeshnizi","year":"2023","journal-title":"arXiv:2310.06116"},{"key":"ref8","article-title":"Large language models as optimizers","author":"Yang","year":"2023","journal-title":"arXiv:2309.03409"},{"key":"ref9","article-title":"Towards optimizing with large language models","author":"Guo","year":"2023","journal-title":"arXiv:2310.05204"},{"key":"ref10","article-title":"Large language models as evolutionary optimizers","author":"Liu","year":"2023","journal-title":"arXiv:2310.19046"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3654238"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3583133.3596401"},{"key":"ref14","article-title":"A survey of large language models","author":"Zhao","year":"2023","journal-title":"arXiv:2303.18223v13"},{"key":"ref15","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021","journal-title":"arXiv:2107.03374"},{"key":"ref16","article-title":"StarCoder: May the source be with you!","author":"Li","year":"2023","journal-title":"arXiv:2305.06161"},{"key":"ref17","article-title":"CodeGen: An open large language model for code with multi-turn program synthesis","volume-title":"Proc. ICLR","author":"Nijkamp"},{"key":"ref18","article-title":"Code LLAMA: Open foundation models for code","author":"Rozi\u00e8re","year":"2023","journal-title":"arXiv:2308.12950"},{"key":"ref19","article-title":"GPT-4 technical report","volume-title":"arXiv:2303.08774","author":"Achiam","year":"2023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2011"},{"key":"ref21","first-page":"4299","article-title":"Deep reinforcement learning from human preferences","volume-title":"Proc. NIPS","volume":"30","author":"Christiano"},{"key":"ref22","article-title":"Fine-tuning language models from human preferences","author":"Ziegler","year":"2019","journal-title":"arXiv:1909.08593"},{"key":"ref23","article-title":"Finetuned language models are zero-shot learners","volume-title":"Proc. ICLR","author":"Wei"},{"key":"ref24","article-title":"Multitask prompted training enables zero-shot task generalization","volume-title":"Proc. ICLR","author":"Sanh"},{"key":"ref25","article-title":"Instruction tuned models are quick learners","author":"Gupta","year":"2023","journal-title":"arXiv:2306.05539"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06291-2"},{"key":"ref27","article-title":"Lawyer LLaMA technical report","volume-title":"arXiv:2305.15062","author":"Huang","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3708882"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.411"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599790"},{"key":"ref31","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. NIPS","volume":"33","author":"Brown"},{"key":"ref32","article-title":"Llama 2: Open foundation and fine-tuned chat models","author":"Touvron","year":"2023","journal-title":"arXiv:2307.09288"},{"key":"ref33","article-title":"Mixtral of experts","author":"Jiang","year":"2024","journal-title":"arXiv:2401.04088"},{"key":"ref34","article-title":"Program synthesis with large language models","author":"Austin","year":"2021","journal-title":"arXiv:2108.07732"},{"key":"ref35","first-page":"18319","article-title":"DS-1000: A natural and reliable benchmark for data science code generation","volume-title":"Proc. ICML","author":"Lai"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1126\/science.abq1158"},{"issue":"3","key":"ref37","first-page":"3","article-title":"Phi-2: The surprising power of small language models","volume":"1","author":"Javaheripi","year":"2023","journal-title":"Microsoft Res. Blog"},{"key":"ref38","article-title":"InCoder: A generative model for code infilling and synthesis","volume-title":"Proc. ICLR","author":"Fried"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3728894"},{"key":"ref40","first-page":"1","article-title":"On the effectiveness of large language models in domain-specific code generation","volume-title":"Proc. ACM Trans. Softw. Eng. Methodology","volume":"34","author":"Gu"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-5581-3_18"},{"key":"ref42","article-title":"Large language model for multi-objective evolutionary optimization","author":"Liu","year":"2023","journal-title":"arXiv:2310.12541"},{"key":"ref43","article-title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","author":"Liu","year":"2024","journal-title":"arXiv:2401.02051"},{"key":"ref44","article-title":"Using large language models for hyperparameter optimization","volume-title":"Proc. NIPS","author":"Zhang"},{"key":"ref45","article-title":"Connecting large language models with evolutionary algorithms yields powerful prompt optimizers","author":"Guo","year":"2023","journal-title":"arXiv:2309.08532"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.emnlp-main.759"},{"key":"ref47","article-title":"Evolution through large models","volume-title":"Handbook of Evolutionary Machine Learning","author":"Lehman","year":"2022"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0342"},{"key":"ref49","article-title":"Large language model-based evolutionary optimizer: Reasoning with elitism","author":"Brahmachary","year":"2024","journal-title":"arXiv:2403.02054"},{"key":"ref50","article-title":"Autonomous multi-objective optimization using large language model","author":"Huang","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref51","article-title":"REMoH: A reflective evolution of multi-objective heuristics approach via large language models","author":"Forni\u00e9s-Tabuenca","year":"2025","journal-title":"arXiv:2506.07759"},{"key":"ref52","article-title":"LLM4AD: A platform for algorithm design with large language model","author":"Liu","year":"2024","journal-title":"arXiv:2412.17287"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3497793"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04654-6"},{"key":"ref55","article-title":"Fine-tuning large language model for automated algorithm design","author":"Liu","year":"2025","journal-title":"arXiv:2507.10614"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2024.1233"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3787965"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101741"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s41965-024-00172-x"},{"key":"ref60","article-title":"Deep insights into automated optimization with large language models and evolutionary algorithms","author":"Yu","year":"2024","journal-title":"arXiv:2410.20848"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.34133\/research.0646"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.52202\/075280-2400"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref64","article-title":"Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization","author":"Wu","year":"2017"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0474"},{"key":"ref66","article-title":"Problem definitions and evaluation criteria for the CEC 2021 on single objective bound constrained numerical optimization","volume-title":"Proc. CEC","author":"Mohamed"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-020-09820-4"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-10042-y"},{"key":"ref69","first-page":"3","article-title":"Bayesian optimization is superior to random search for machine learning hyperparameter tuning: Analysis of the black-box optimization challenge 2020","volume-title":"Proc. NIPS","author":"Turner"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000187"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3240467"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2979821"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504792"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101403"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2475174"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2020.1867120"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190398"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_30"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570333"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3034769"},{"key":"ref84","article-title":"Practical Bayesian optimization of machine learning algorithms","volume-title":"Proc. NIPS","author":"Snoek"},{"key":"ref85","first-page":"19511","article-title":"Learning search space partition for black-box optimization using Monte Carlo tree search","volume-title":"Proc. NIPS","author":"Wang"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(97)00474-X"},{"key":"ref89","article-title":"A software package for sequential quadratic programming","author":"Kraft","year":"1988","journal-title":"Forschungsbericht-Deutsche Forschungs-Und Versuchsanstalt Fur Luft-Und Raumfahrt"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref91","article-title":"A view of algorithms for optimization without derivatives","volume-title":"Mathematics Today-Bulletin of the Institute of Mathematics and Its Applications","author":"Powell","year":"2007"},{"key":"ref92","first-page":"620","article-title":"A progressive batching L-BFGS method for machine learning","volume-title":"Proc. ICML","author":"Bollapragada"},{"issue":"1","key":"ref93","first-page":"2171","article-title":"DEAP: Evolutionary algorithms made easy","volume":"13","author":"Fortin","year":"2012","journal-title":"JMLR"},{"key":"ref94","article-title":"JudgeLM: Fine-tuned large language models are scalable judges","author":"Zhu","year":"2023","journal-title":"arXiv:2310.17631"},{"key":"ref95","article-title":"AlpaCare: Instruction-tuned large language models for medical application","author":"Zhang","year":"2023","journal-title":"arXiv:2310.14558"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0944"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.658"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.52202\/075280-2703"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.499"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref101","article-title":"HuggingFace\u2019s transformers: State-of-the-art natural language processing","author":"Wolf","year":"2019","journal-title":"arXiv:1910.03771"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007735"},{"issue":"140","key":"ref103","first-page":"1","article-title":"Exploring the limits of transfer learning with a unified text-to-text transformer","volume":"21","author":"Raffel","year":"2019","journal-title":"JMLR"},{"key":"ref104","article-title":"DeepSeekMath: Pushing the limits of mathematical reasoning in open language models","author":"Shao","year":"2024","journal-title":"arXiv:2402.03300"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2024.3374889"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.emnlp-main.90"},{"key":"ref108","article-title":"Code generation tools (almost) for free? A study of few-shot, pre-trained language models on code","author":"Barei\u00df","year":"2022","journal-title":"arXiv:2206.01335"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53032-0"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1021\/i260070a031"},{"key":"ref111","article-title":"Optimum design of robot grippers using genetic algorithms","volume-title":"Proc. WCSMO","author":"Osyczka"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2743761"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2010.2047824"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1002\/prot.22830"},{"key":"ref115","article-title":"HPO-B: A large-scale reproducible benchmark for black-box HPO based on openml","author":"Arango","year":"2021","journal-title":"arXiv:2106.06257"},{"key":"ref116","article-title":"Deep neuroevolution: Genetic algorithms are a competitive alternative for training deep neural networks for reinforcement learning","author":"Such","year":"2017","journal-title":"arXiv:1712.06567"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.128645"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690320215"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(94)00097-2"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6797-7"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-002-0218-y"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechmachtheory.2006.10.002"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1115\/DETC1988-0012"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2018.08.031"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100693"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1145\/3583133.3590697"},{"key":"ref127","first-page":"5235","article-title":"Large language model-enhanced algorithm selection: Towards comprehensive algorithm representation","volume-title":"Proc. AAAI","author":"Wu"},{"issue":"54","key":"ref128","first-page":"1","article-title":"SMAC3: A versatile Bayesian optimization package for hyperparameter optimization","volume":"23","author":"Lindauer","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref129","volume-title":"Knowledge Retrieval Documentations","year":"2023"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11635978\/11359290.pdf?arnumber=11359290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T04:41:07Z","timestamp":1785818467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":129,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2026.3656374","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,8]]}}}