Qianqian Yu , Chen Yang , Guangming Dai , Lei Peng
{"title":"区间不确定多目标优化的非概率集选择策略","authors":"Qianqian Yu , Chen Yang , Guangming Dai , Lei Peng","doi":"10.1016/j.swevo.2025.102153","DOIUrl":null,"url":null,"abstract":"<div><div>Uncertainty introduces great challenges for multi-objective optimization, as the solutions are no longer deterministic values, complicating both the accurate evaluation of solution quality and the selection of elite solutions. Misjudging the dominance relationship among uncertain solutions may result in the loss of superior solutions, and imprecise crowding distance quantification may fail to maintain population diversity. Therefore, a novel non-probabilistic set-based selection strategy (NPS) is developed to balance the convergence and diversity of uncertain populations. It employs a novel two-dimensional interval dominance relationship and an interval crowding distance model to determine the new parent population. Additionally, a dimension-wise approach (DWA), a non-intrusive uncertainty analysis model, is used to quantify the bounds of uncertain optimization objectives. Furthermore, a novel interval crowding distance-based sample standard deviation metric is proposed to enhance the accuracy of diversity evaluation for uncertain populations. The proposed NPS is integrated into two classical multi-objective optimization frameworks and is compared with other selection strategies across multiple groups of benchmarks. The results indicate that algorithms incorporating NPS and DWA can not only effectively explore the Pareto Front under uncertainties but also directly evaluate uncertain solutions with limited samples. Compared with other selection strategies, NPS can explore an optimal solution set with superior convergence, higher diversity, and lower uncertainty.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102153"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Non-probabilistic set-based selection strategy for multi-objective optimization with interval uncertainties\",\"authors\":\"Qianqian Yu , Chen Yang , Guangming Dai , Lei Peng\",\"doi\":\"10.1016/j.swevo.2025.102153\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Uncertainty introduces great challenges for multi-objective optimization, as the solutions are no longer deterministic values, complicating both the accurate evaluation of solution quality and the selection of elite solutions. Misjudging the dominance relationship among uncertain solutions may result in the loss of superior solutions, and imprecise crowding distance quantification may fail to maintain population diversity. Therefore, a novel non-probabilistic set-based selection strategy (NPS) is developed to balance the convergence and diversity of uncertain populations. It employs a novel two-dimensional interval dominance relationship and an interval crowding distance model to determine the new parent population. Additionally, a dimension-wise approach (DWA), a non-intrusive uncertainty analysis model, is used to quantify the bounds of uncertain optimization objectives. Furthermore, a novel interval crowding distance-based sample standard deviation metric is proposed to enhance the accuracy of diversity evaluation for uncertain populations. The proposed NPS is integrated into two classical multi-objective optimization frameworks and is compared with other selection strategies across multiple groups of benchmarks. The results indicate that algorithms incorporating NPS and DWA can not only effectively explore the Pareto Front under uncertainties but also directly evaluate uncertain solutions with limited samples. Compared with other selection strategies, NPS can explore an optimal solution set with superior convergence, higher diversity, and lower uncertainty.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102153\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-09-02\",\"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/S2210650225003104\",\"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/S2210650225003104","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Non-probabilistic set-based selection strategy for multi-objective optimization with interval uncertainties
Uncertainty introduces great challenges for multi-objective optimization, as the solutions are no longer deterministic values, complicating both the accurate evaluation of solution quality and the selection of elite solutions. Misjudging the dominance relationship among uncertain solutions may result in the loss of superior solutions, and imprecise crowding distance quantification may fail to maintain population diversity. Therefore, a novel non-probabilistic set-based selection strategy (NPS) is developed to balance the convergence and diversity of uncertain populations. It employs a novel two-dimensional interval dominance relationship and an interval crowding distance model to determine the new parent population. Additionally, a dimension-wise approach (DWA), a non-intrusive uncertainty analysis model, is used to quantify the bounds of uncertain optimization objectives. Furthermore, a novel interval crowding distance-based sample standard deviation metric is proposed to enhance the accuracy of diversity evaluation for uncertain populations. The proposed NPS is integrated into two classical multi-objective optimization frameworks and is compared with other selection strategies across multiple groups of benchmarks. The results indicate that algorithms incorporating NPS and DWA can not only effectively explore the Pareto Front under uncertainties but also directly evaluate uncertain solutions with limited samples. Compared with other selection strategies, NPS can explore an optimal solution set with superior convergence, higher diversity, and lower uncertainty.
期刊介绍:
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.