Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/114103
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.contributorDepartment of Data Science and Artificial Intelligence-
dc.creatorLiang, Zen_US
dc.creatorLi, Hen_US
dc.creatorYu, Nen_US
dc.creatorSun, Ken_US
dc.creatorCheng, Ren_US
dc.date.accessioned2025-07-11T09:11:38Z-
dc.date.available2025-07-11T09:11:38Z-
dc.identifier.issn1089-778Xen_US
dc.identifier.urihttp://hdl.handle.net/10397/114103-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.subjectEvolutionary Multiobjective Optimizationen_US
dc.subjectGPU Accelerationen_US
dc.subjectRobot Controlen_US
dc.subjectTensorizationen_US
dc.titleBridging evolutionary multiobjective optimization and GPU acceleration via tensorizationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.epage en_US
dc.identifier.doi10.1109/TEVC.2025.3555605en_US
dcterms.abstractEvolutionary multiobjective optimization (EMO) has made significant strides over the past two decades. However, as problem scales and complexities increase, traditional EMO algorithms face substantial performance limitations due to insufficient parallelism and scalability. While most work has focused on algorithm design to address these challenges, little attention has been given to hardware acceleration, thereby leaving a clear gap between EMO algorithms and advanced computing devices, such as GPUs. To bridge the gap, we propose to parallelize EMO algorithms on GPUs via the tensorization methodology. By employing tensorization, the data structures and operations of EMO algorithms are transformed into concise tensor representations, which seamlessly enables automatic utilization of GPU computing. We demonstrate the effectiveness of our approach by applying it to three representative EMO algorithms: NSGA-III, MOEA/D, and HypE. To comprehensively assess our methodology, we introduce a multiobjective robot control benchmark using a GPU-accelerated physics engine. Our experiments show that the tensorized EMO algorithms achieve speedups of up to 1113× compared to their CPU-based counterparts, while maintaining solution quality and effectively scaling population sizes to hundreds of thousands. Furthermore, the tensorized EMO algorithms efficiently tackle complex multiobjective robot control tasks, producing high-quality solutions with diverse behaviors. Source codes are available at https://github.com/EMI-Group/evomo.-
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationIEEE transactions on evolutionary computation, Date of Publication: 28 March 2025, Early Access, https://doi.org/10.1109/TEVC.2025.3555605en_US
dcterms.isPartOfIEEE transactions on evolutionary computationen_US
dcterms.issued2025-
dc.identifier.scopus2-s2.0-105001547885-
dc.identifier.eissn1941-0026en_US
dc.description.validate202507 bcch-
dc.identifier.FolderNumbera3857a-
dc.identifier.SubFormID51447-
dc.description.fundingSourceSelf-fundeden_US
dc.description.fundingText en_US
dc.description.pubStatusEarly releaseen_US
dc.date.embargo0000-00-00 (to be updated)en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 0000-00-00 (to be updated)
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


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