{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:33:58Z","timestamp":1778348038956,"version":"3.51.4"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001348","name":"Agency for Science, Technology and Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001348","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Prenatal\/Early Childhood","award":["H23P1M0006"],"award-info":[{"award-number":["H23P1M0006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2025.3592367","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T17:56:50Z","timestamp":1753379810000},"page":"1191-1206","source":"Crossref","is-referenced-by-count":6,"title":["Can Large Language Models Be Trusted as Evolutionary Optimizers for Network-Structured Combinatorial Problems?"],"prefix":"10.1109","volume":"13","author":[{"given":"Jie","family":"Zhao","sequence":"first","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8490-1628","authenticated-orcid":false,"given":"Tao","family":"Wen","sequence":"additional","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4475-5451","authenticated-orcid":false,"given":"Kang Hao","family":"Cheong","sequence":"additional","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref2","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc.Adv. Neural Inf. Process. Syst.","volume":"33","author":"Brown","year":"2020"},{"key":"ref3","first-page":"15718","article-title":"Iron: Private inference on transformers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Hao","year":"2022,"},{"key":"ref4","article-title":"Large language models are human-level prompt engineers","author":"Zhou","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.7.L022012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2024.3506731"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3664086"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.34133\/research.0646"},{"key":"ref9","article-title":"Large language models as optimizers","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Yang","year":"2023"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3242051"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10611913"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.129272"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-3538-2_13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3694791"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.6.L032009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06924-6"},{"key":"ref17","article-title":"Talk like a graph: Encoding graphs for large language models","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Fatemi","year":"2024"},{"key":"ref18","first-page":"30840","article-title":"Can language models solve graph problems in natural language?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Wang","year":"2024,"},{"key":"ref19","article-title":"Exploring the true potential: Evaluating the black-box optimization capability of large language models","author":"Huang","year":"2024"},{"key":"ref20","article-title":"Hallucination is inevitable: An innate limitation of large language models","author":"Xu","year":"2024"},{"key":"ref21","article-title":"LLM Lies: Hallucinations are not bugs, but features as adversarial examples","author":"Yao","year":"2023"},{"key":"ref22","article-title":"Do LLMs know about hallucination? An empirical investigation of LLM\u2019s hidden states","author":"Duan","year":"2024"},{"key":"ref23","article-title":"Deep insights into automated optimization with large language models and evolutionary algorithms","author":"Yu","year":"2024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-56855-8_13"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654178"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-3814-8_11"},{"key":"ref27","article-title":"Importance of directional feedback for LLM-based optimizers","volume-title":"Proc. NeurIPS 2023 Found. Models Decis. Mak. Workshop","author":"Nie","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48796-5_13"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-5581-3_18"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2025.3561001"},{"key":"ref31","article-title":"Algorithm evolution using large language model","author":"Liu","year":"2023"},{"key":"ref32","article-title":"An example of evolutionary computation  large language model beating human: Design of efficient guided local search","author":"Liu","year":"2024"},{"key":"ref33","first-page":"32201","article-title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Liu","year":"2024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3583133.3596401"},{"key":"ref35","article-title":"Identify critical nodes in complex network with large language models","author":"Mao","year":"2024"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-90065-5_25"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101741"},{"key":"ref38","article-title":"AS-LLM: When algorithm selection meets large language model","author":"Wu","year":"2023"},{"key":"ref39","article-title":"SPELL: Semantic prompt evolution based on a LLM","author":"Li","year":"2023"},{"key":"ref40","article-title":"Connecting large language models with evolutionary algorithms yields powerful prompt optimizers","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Guo","year":"2024"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-29956-8_12"},{"key":"ref42","article-title":"Bridging visualization and optimization: Multimodal large language models on graph-structured combinatorial optimization","author":"Zhao","year":"2025"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3356652"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3389\/fnsys.2021.624183"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-023-00676-y"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2024.3389751"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3312476"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3239546"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3381042"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2024.3359265"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3196887"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3243560"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3295911"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2024.3518560"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3048174"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2023.3241621"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2023.3240765"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2025.3592664"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3234152"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3257563"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3420911"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3020423"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3109914"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2023.3245729"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2912801"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.07.084"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3362903"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3189036"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102945"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2950935"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2025.3598266"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11095418.pdf?arnumber=11095418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:43:40Z","timestamp":1764787420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11095418\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3592367","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}