{"title":"基于增量高斯混合模型的动态多目标优化算法","authors":"Xuewen Xia, Yi Zeng, Xing Xu, Yinglong Zhang","doi":"10.1016/j.swevo.2025.102067","DOIUrl":null,"url":null,"abstract":"<div><div>In recent years, prediction-based algorithms have made significant progress in solving dynamic multi-objective optimization problems (DMOPs). However, most existing methods only consider information from several consecutive environments and ignore past search experiences. To address the issue, this paper proposes a novel dynamic multi-objective evolutionary algorithm (DMOEA) based on an incremental Gaussian mixture model (IGMM). When environmental changes occurred, the initial population in the new environment is composed of two parts. The one part includes a few predicted individuals generated by IGMM aiming to explore the potential correlation between environments. To ensure quality of the individuals generated by IGMM, a feature-based augmentation strategy is employed to generate representative training data before the training process of IGMM. The other part consists of some individuals created via polynomial mutation operator based on randomly selected solutions from the previous environment. Based on the hybrid initial population, IGMM-DMOEA can quickly respond to environmental changes. To testify the performance of IGMM-DMOEA, twenty widely used benchmark functions and three real-world applications are adopted in this study. Extensive experimental results verify that IGMM-DMOEA can exhibit effective response to environmental changes. Comparisons results between it and other seven peer algorithms suggest that IGMM-DMOEA attains more reliable performance, measured by three popular metrics. Moreover, the effectiveness and efficiency of the new proposed strategies are discussed based on extensive experiments.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102067"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic multi-objective optimization algorithm based on incremental Gaussian mixture model\",\"authors\":\"Xuewen Xia, Yi Zeng, Xing Xu, Yinglong Zhang\",\"doi\":\"10.1016/j.swevo.2025.102067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In recent years, prediction-based algorithms have made significant progress in solving dynamic multi-objective optimization problems (DMOPs). However, most existing methods only consider information from several consecutive environments and ignore past search experiences. To address the issue, this paper proposes a novel dynamic multi-objective evolutionary algorithm (DMOEA) based on an incremental Gaussian mixture model (IGMM). When environmental changes occurred, the initial population in the new environment is composed of two parts. The one part includes a few predicted individuals generated by IGMM aiming to explore the potential correlation between environments. To ensure quality of the individuals generated by IGMM, a feature-based augmentation strategy is employed to generate representative training data before the training process of IGMM. The other part consists of some individuals created via polynomial mutation operator based on randomly selected solutions from the previous environment. Based on the hybrid initial population, IGMM-DMOEA can quickly respond to environmental changes. To testify the performance of IGMM-DMOEA, twenty widely used benchmark functions and three real-world applications are adopted in this study. Extensive experimental results verify that IGMM-DMOEA can exhibit effective response to environmental changes. Comparisons results between it and other seven peer algorithms suggest that IGMM-DMOEA attains more reliable performance, measured by three popular metrics. Moreover, the effectiveness and efficiency of the new proposed strategies are discussed based on extensive experiments.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102067\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-07-21\",\"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/S2210650225002251\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002251","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Dynamic multi-objective optimization algorithm based on incremental Gaussian mixture model
In recent years, prediction-based algorithms have made significant progress in solving dynamic multi-objective optimization problems (DMOPs). However, most existing methods only consider information from several consecutive environments and ignore past search experiences. To address the issue, this paper proposes a novel dynamic multi-objective evolutionary algorithm (DMOEA) based on an incremental Gaussian mixture model (IGMM). When environmental changes occurred, the initial population in the new environment is composed of two parts. The one part includes a few predicted individuals generated by IGMM aiming to explore the potential correlation between environments. To ensure quality of the individuals generated by IGMM, a feature-based augmentation strategy is employed to generate representative training data before the training process of IGMM. The other part consists of some individuals created via polynomial mutation operator based on randomly selected solutions from the previous environment. Based on the hybrid initial population, IGMM-DMOEA can quickly respond to environmental changes. To testify the performance of IGMM-DMOEA, twenty widely used benchmark functions and three real-world applications are adopted in this study. Extensive experimental results verify that IGMM-DMOEA can exhibit effective response to environmental changes. Comparisons results between it and other seven peer algorithms suggest that IGMM-DMOEA attains more reliable performance, measured by three popular metrics. Moreover, the effectiveness and efficiency of the new proposed strategies are discussed based on extensive experiments.
期刊介绍:
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.