Guoqing Li , Weiwei Zhang , Caitong Yue , Yirui Wang , Yu Xin , Kui Gao
{"title":"约束多模态多目标优化的动态等级辅助协同进化算法","authors":"Guoqing Li , Weiwei Zhang , Caitong Yue , Yirui Wang , Yu Xin , Kui Gao","doi":"10.1016/j.swevo.2024.101744","DOIUrl":null,"url":null,"abstract":"<div><div>Constrained multimodal multi-objective optimization problems (CMMOPs) are characterized by multiple constrained Pareto sets (CPSs) sharing the same constrained Pareto front (CPF). The challenge lies in efficiently identifying equivalent CPSs while maintaining a balance among convergence, diversity, and constraints. Addressing this challenge, we propose a dynamic-ranking-based constraint handling technique implemented in a co-evolutionary algorithm, named DRCEA, specifically designed for solving CMMOPs. To search for equivalent CPSs, we introduce a co-evolutionary framework involving two populations: a convergence-first population and a constraint-first population. The co-evolutionary framework facilitates knowledge transfer and sustains diverse solutions. Subsequently, a dynamic ranking strategy is employed with dynamic weight parameters that consider both dominance and constraint relationships among individuals. Within the convergence-first population, the weight parameter for convergence gradually decreases, while the constraint parameter increases. Conversely, in the constraint-first population, the weight parameter for constraints gradually decreases, while the convergence parameter increases. This approach ensures a well-balanced consideration of convergence and constraints within the two distinct populations. Experimental results on the CMMOP test suite and the real-world CMMOP test scenario validate the effectiveness of the proposed dynamic-ranking-based constraint handling technique, demonstrating the superiority of DRCEA over seven state-of-the-art algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101744"},"PeriodicalIF":8.2000,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic-ranking-assisted co-evolutionary algorithm for constrained multimodal multi-objective optimization\",\"authors\":\"Guoqing Li , Weiwei Zhang , Caitong Yue , Yirui Wang , Yu Xin , Kui Gao\",\"doi\":\"10.1016/j.swevo.2024.101744\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Constrained multimodal multi-objective optimization problems (CMMOPs) are characterized by multiple constrained Pareto sets (CPSs) sharing the same constrained Pareto front (CPF). The challenge lies in efficiently identifying equivalent CPSs while maintaining a balance among convergence, diversity, and constraints. Addressing this challenge, we propose a dynamic-ranking-based constraint handling technique implemented in a co-evolutionary algorithm, named DRCEA, specifically designed for solving CMMOPs. To search for equivalent CPSs, we introduce a co-evolutionary framework involving two populations: a convergence-first population and a constraint-first population. The co-evolutionary framework facilitates knowledge transfer and sustains diverse solutions. Subsequently, a dynamic ranking strategy is employed with dynamic weight parameters that consider both dominance and constraint relationships among individuals. Within the convergence-first population, the weight parameter for convergence gradually decreases, while the constraint parameter increases. Conversely, in the constraint-first population, the weight parameter for constraints gradually decreases, while the convergence parameter increases. This approach ensures a well-balanced consideration of convergence and constraints within the two distinct populations. Experimental results on the CMMOP test suite and the real-world CMMOP test scenario validate the effectiveness of the proposed dynamic-ranking-based constraint handling technique, demonstrating the superiority of DRCEA over seven state-of-the-art algorithms.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"91 \",\"pages\":\"Article 101744\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-09-28\",\"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/S2210650224002827\",\"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/S2210650224002827","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
A dynamic-ranking-assisted co-evolutionary algorithm for constrained multimodal multi-objective optimization
Constrained multimodal multi-objective optimization problems (CMMOPs) are characterized by multiple constrained Pareto sets (CPSs) sharing the same constrained Pareto front (CPF). The challenge lies in efficiently identifying equivalent CPSs while maintaining a balance among convergence, diversity, and constraints. Addressing this challenge, we propose a dynamic-ranking-based constraint handling technique implemented in a co-evolutionary algorithm, named DRCEA, specifically designed for solving CMMOPs. To search for equivalent CPSs, we introduce a co-evolutionary framework involving two populations: a convergence-first population and a constraint-first population. The co-evolutionary framework facilitates knowledge transfer and sustains diverse solutions. Subsequently, a dynamic ranking strategy is employed with dynamic weight parameters that consider both dominance and constraint relationships among individuals. Within the convergence-first population, the weight parameter for convergence gradually decreases, while the constraint parameter increases. Conversely, in the constraint-first population, the weight parameter for constraints gradually decreases, while the convergence parameter increases. This approach ensures a well-balanced consideration of convergence and constraints within the two distinct populations. Experimental results on the CMMOP test suite and the real-world CMMOP test scenario validate the effectiveness of the proposed dynamic-ranking-based constraint handling technique, demonstrating the superiority of DRCEA over seven 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.