Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/113678
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Data Science and Artificial Intelligenceen_US
dc.creatorHuang, Yen_US
dc.creatorWu, Sen_US
dc.creatorZhang, Wen_US
dc.creatorWu, Jen_US
dc.creatorFeng, Len_US
dc.creatorTan, KCen_US
dc.date.accessioned2025-06-17T07:40:51Z-
dc.date.available2025-06-17T07:40:51Z-
dc.identifier.issn1089-778Xen_US
dc.identifier.urihttp://hdl.handle.net/10397/113678-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.rightsThe following publication Y. Huang, S. Wu, W. Zhang, J. Wu, L. Feng and K. C. Tan, "Autonomous Multiobjective Optimization Using Large Language Model," in IEEE Transactions on Evolutionary Computation, vol. 30, no. 2, pp. 594-608, April 2026 is available at https://doi.org/10.1109/TEVC.2025.3561001.en_US
dc.subjectAutomatic Algorithm Designen_US
dc.subjectLarge Language Modeen_US
dc.subjectMulti-objective Optimizationen_US
dc.titleAutonomous multi-objective optimization using large language modelen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage594en_US
dc.identifier.epage608en_US
dc.identifier.volume30en_US
dc.identifier.issue2en_US
dc.identifier.doi10.1109/TEVC.2025.3561001en_US
dcterms.abstractMulti-objective optimization problems (MOPs) are ubiquitous in real-world applications, presenting a complex challenge of balancing multiple conflicting objectives. Traditional multi-objective evolutionary algorithms (MOEAs), though effective, often rely on domain-specific expertise for improved optimization performance, hindering adaptability to unseen MOPs. In recent years, the Large Language Models (LLMs) has revolutionized software engineering by enabling the autonomous generation and refinement of programs. Leveraging this breakthrough, we propose a new LLM-based framework that autonomously designs MOEAs for solving MOPs. The proposed framework includes a robust testing module to refine the generated MOEA through error-driven dialogue with LLMs, a dynamic selection strategy along with informative prompting-based crossover and mutation to fit textual optimization pipeline. Our approach facilitates the design of MOEA without the extensive demands for expert intervention, thereby speeding up the innovation of MOEA. Empirical studies across various MOP categories validate the robustness and superior performance of our proposed framework.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on evolutionary computation, Apr. 2026, v. 30, no. 2, p. 594-608en_US
dcterms.isPartOfIEEE transactions on evolutionary computationen_US
dcterms.issued2026-04-
dc.identifier.scopus2-s2.0-105002843655-
dc.identifier.eissn1941-0026en_US
dc.description.validate202506 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera3717b-
dc.identifier.SubFormID50842-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThe National Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Huang_Autonomous_Multi_Objective.pdfPre-Published version8.65 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

74
Citations as of Feb 9, 2026

SCOPUSTM   
Citations

12
Citations as of Apr 17, 2026

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.