Panpan Zhang , Ru Zhang , Ye Tian , Kay Chen Tan , Xingyi Zhang
{"title":"A dual model-based evolutionary framework for dynamic large-scale sparse multiobjective optimization","authors":"Panpan Zhang , Ru Zhang , Ye Tian , Kay Chen Tan , Xingyi Zhang","doi":"10.1016/j.swevo.2025.102011","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, there has been a growing interest in dynamic multiobjective optimization problems (DMOPs). Although some evolutionary algorithms have been tailored for DMOPs, their effectiveness is limited when handling large-scale DMOPs, especially those characterized by sparsity, where most variables in Pareto-optimal solutions are equal to zero. To address this issue, this paper proposes a dual model-based evolutionary framework to solve dynamic large-scale sparse multiobjective optimization problems (DSMOPs). Specifically, the proposed framework addresses dynamic changes by predicting a new initial population for a static multiobjective optimization evolutionary algorithm in the new environment. Based on the idea of initial population prediction, the proposed framework transforms the large-scale variable prediction into the small-scale variable prediction, where support vector regression is introduced to predict the sparse distributions of the new initial population to reduce the decision space, and multilayer perceptron is performed on the reduced space to predict its continuous distributions. By integrating the two simplified predictions, a two-layer change response mechanism is constructed to ensure both the sparsity and quality of the obtained solutions. In addition, this paper designs the benchmark and real-world test problems to assess the performance of the proposed framework for tackling large-scale DMOPs. Experimental results demonstrate the superiority of the proposed framework compared with the six state-of-the-art algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102011"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001695","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Recently, there has been a growing interest in dynamic multiobjective optimization problems (DMOPs). Although some evolutionary algorithms have been tailored for DMOPs, their effectiveness is limited when handling large-scale DMOPs, especially those characterized by sparsity, where most variables in Pareto-optimal solutions are equal to zero. To address this issue, this paper proposes a dual model-based evolutionary framework to solve dynamic large-scale sparse multiobjective optimization problems (DSMOPs). Specifically, the proposed framework addresses dynamic changes by predicting a new initial population for a static multiobjective optimization evolutionary algorithm in the new environment. Based on the idea of initial population prediction, the proposed framework transforms the large-scale variable prediction into the small-scale variable prediction, where support vector regression is introduced to predict the sparse distributions of the new initial population to reduce the decision space, and multilayer perceptron is performed on the reduced space to predict its continuous distributions. By integrating the two simplified predictions, a two-layer change response mechanism is constructed to ensure both the sparsity and quality of the obtained solutions. In addition, this paper designs the benchmark and real-world test problems to assess the performance of the proposed framework for tackling large-scale DMOPs. Experimental results demonstrate the superiority of the proposed framework compared with the six state-of-the-art algorithms.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.