{"title":"动态多目标优化的自适应多区域预测策略","authors":"Tao Zhang , LinJun Yu , HuiWen Yu","doi":"10.1016/j.asoc.2025.113072","DOIUrl":null,"url":null,"abstract":"<div><div>This paper proposes a novel adaptive multi-region prediction strategy for dynamic multi-objective optimization problems (DMOPs), which aims to efficiently generate diverse populations in response to environmental changes and facilitate the exploration of the new Pareto front. The strategy consists of two main phases: predictive population initialization and elite-guided resampling. In the predictive population initialization phase, the strategy integrates global exploration and local exploitation. Global exploration divides the population into <span><math><mi>N</mi></math></span> subregions based on population distribution characteristics. For each subregion, the historical information of its center point is used to predict its new position in the next environment, and then a Gaussian mixture model (GMM) is used to sample new individuals based on the position information of all new center points. Local exploitation employs the K-Medoids method to cluster historical Pareto fronts and selects individuals corresponding to the medoids in the decision space as representative individuals. These representative individuals are then used to predict their new locations, followed by Gaussian sampling to generate individuals. The initial predicted population is formed by combining the individuals from global exploration, local exploitation, and randomly generated individuals. In the elite-guided resampling phase, the initial predicted population is evaluated, and top-ranked elite individuals are selected. These elites guide the generation of the final population through Gaussian sampling and Latin Hypercube Sampling (LHS), enhancing solution quality and diversity. The proposed strategy is validated on 14 benchmark problems using MIGD, MHV, R(IGD), and DMIGD metrics. Results demonstrate its better comprehensive performance under varying environmental change intensities (mild, moderate, and severe) compared to existing approaches. Furthermore, its application to a real-world PID controller tuning problem highlights the strategy’s practical potential, showcasing superior performance.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"176 ","pages":"Article 113072"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive multi-region prediction strategy for dynamic multi-objective optimization\",\"authors\":\"Tao Zhang , LinJun Yu , HuiWen Yu\",\"doi\":\"10.1016/j.asoc.2025.113072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper proposes a novel adaptive multi-region prediction strategy for dynamic multi-objective optimization problems (DMOPs), which aims to efficiently generate diverse populations in response to environmental changes and facilitate the exploration of the new Pareto front. The strategy consists of two main phases: predictive population initialization and elite-guided resampling. In the predictive population initialization phase, the strategy integrates global exploration and local exploitation. Global exploration divides the population into <span><math><mi>N</mi></math></span> subregions based on population distribution characteristics. For each subregion, the historical information of its center point is used to predict its new position in the next environment, and then a Gaussian mixture model (GMM) is used to sample new individuals based on the position information of all new center points. Local exploitation employs the K-Medoids method to cluster historical Pareto fronts and selects individuals corresponding to the medoids in the decision space as representative individuals. These representative individuals are then used to predict their new locations, followed by Gaussian sampling to generate individuals. The initial predicted population is formed by combining the individuals from global exploration, local exploitation, and randomly generated individuals. In the elite-guided resampling phase, the initial predicted population is evaluated, and top-ranked elite individuals are selected. These elites guide the generation of the final population through Gaussian sampling and Latin Hypercube Sampling (LHS), enhancing solution quality and diversity. The proposed strategy is validated on 14 benchmark problems using MIGD, MHV, R(IGD), and DMIGD metrics. Results demonstrate its better comprehensive performance under varying environmental change intensities (mild, moderate, and severe) compared to existing approaches. Furthermore, its application to a real-world PID controller tuning problem highlights the strategy’s practical potential, showcasing superior performance.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"176 \",\"pages\":\"Article 113072\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625003837\",\"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":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625003837","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Adaptive multi-region prediction strategy for dynamic multi-objective optimization
This paper proposes a novel adaptive multi-region prediction strategy for dynamic multi-objective optimization problems (DMOPs), which aims to efficiently generate diverse populations in response to environmental changes and facilitate the exploration of the new Pareto front. The strategy consists of two main phases: predictive population initialization and elite-guided resampling. In the predictive population initialization phase, the strategy integrates global exploration and local exploitation. Global exploration divides the population into subregions based on population distribution characteristics. For each subregion, the historical information of its center point is used to predict its new position in the next environment, and then a Gaussian mixture model (GMM) is used to sample new individuals based on the position information of all new center points. Local exploitation employs the K-Medoids method to cluster historical Pareto fronts and selects individuals corresponding to the medoids in the decision space as representative individuals. These representative individuals are then used to predict their new locations, followed by Gaussian sampling to generate individuals. The initial predicted population is formed by combining the individuals from global exploration, local exploitation, and randomly generated individuals. In the elite-guided resampling phase, the initial predicted population is evaluated, and top-ranked elite individuals are selected. These elites guide the generation of the final population through Gaussian sampling and Latin Hypercube Sampling (LHS), enhancing solution quality and diversity. The proposed strategy is validated on 14 benchmark problems using MIGD, MHV, R(IGD), and DMIGD metrics. Results demonstrate its better comprehensive performance under varying environmental change intensities (mild, moderate, and severe) compared to existing approaches. Furthermore, its application to a real-world PID controller tuning problem highlights the strategy’s practical potential, showcasing superior performance.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.