{"title":"Large-Scale Constrained Multiobjective Optimization Based on Variable Adaptive Optimization and Population Reconstruction","authors":"Kunjie Yu;Zhenyu Yang;Jing Liang;Kangjia Qiao;Boyang Qu;Qiao Peng;Ponnuthurai Nagaratnam Suganthan","doi":"10.1109/TETCI.2025.3641668","DOIUrl":null,"url":null,"abstract":"Constrained multiobjective evolutionary algorithms (CMOEAs) have been proposed to address constrained multiobjective optimization problems (CMOPs), and they have shown promising performance on small-scale problems. However, for CMOPs with large-scale decision variables, complex coupling relationships among variables and the huge search space make the algorithm converge slowly and difficult to find feasible solutions. Therefore, this study proposes a large-scale CMOEA based on variable adaptive optimization and population reconstruction to better solve large-scale CMOPs. First, a variable adaptive optimization strategy is developed in the global search stage, where convergence-related and diversity-related variables are adaptively selected for optimization. This strategy reduces the variable optimization difficulty caused by complex coupling relationships and explores the entire search space to locate regions near the constrained Pareto front (CPF). Then, in the local search stage, an archive-assisted population reconstruction strategy is proposed to generate an initial population by using promising solutions from the global search stage to rapidly guide the population towards the CPF. The experiments are conducted on 43 benchmark problems with up to 1000 decision variables and five real-world problems. Results show that the proposed method has better performance than other latest algorithms.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"10 2","pages":"1625-1640"},"PeriodicalIF":6.0000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11303116/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/17 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Constrained multiobjective evolutionary algorithms (CMOEAs) have been proposed to address constrained multiobjective optimization problems (CMOPs), and they have shown promising performance on small-scale problems. However, for CMOPs with large-scale decision variables, complex coupling relationships among variables and the huge search space make the algorithm converge slowly and difficult to find feasible solutions. Therefore, this study proposes a large-scale CMOEA based on variable adaptive optimization and population reconstruction to better solve large-scale CMOPs. First, a variable adaptive optimization strategy is developed in the global search stage, where convergence-related and diversity-related variables are adaptively selected for optimization. This strategy reduces the variable optimization difficulty caused by complex coupling relationships and explores the entire search space to locate regions near the constrained Pareto front (CPF). Then, in the local search stage, an archive-assisted population reconstruction strategy is proposed to generate an initial population by using promising solutions from the global search stage to rapidly guide the population towards the CPF. The experiments are conducted on 43 benchmark problems with up to 1000 decision variables and five real-world problems. Results show that the proposed method has better performance than other latest algorithms.
期刊介绍:
The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys.
TETCI is an electronics only publication. TETCI publishes six issues per year.
Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.