Ruyue Zhang , Shuhua Mao , Shangrui Zhao , Chang Liu
{"title":"用于多模式多目标优化的具有均衡多样性和收敛性的算术优化算法","authors":"Ruyue Zhang , Shuhua Mao , Shangrui Zhao , Chang Liu","doi":"10.1016/j.swevo.2024.101724","DOIUrl":null,"url":null,"abstract":"<div><p>Multimodal multiobjective optimization problems are widely prevalent in real life. Addressing these challenges is crucial as they directly impact the efficiency and effectiveness of solutions across various domains. This paper proposes a novel Multi-Modal Multi-Objective Arithmetic Optimization Algorithm (MMOP-AOA), aimed at achieving a high balance between diversity and convergence in both decision and objective spaces. Arithmetic Optimization Algorithm (AOA) is a highly competitive metaheuristic optimization algorithm with strong exploration and exploitation capabilities. MMOP-AOA extends the AOA for the first time to solve multimodal multiobjective problems, with the following ideas: Firstly, a new exploration and exploitation strategy (NBC<img>NEE) is designed based on the characteristics of AOA.The strategy utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs). Secondly, a convergence and diversity balance mechanism (CDBM) is developed. This mechanism involves comparing the convergence indicator and diversity indicator to select different mutation strategies. Thirdly, an improved crowding distance (ICD) is proposed to address the deficiencies of existing special crowding distance measures. The effectiveness of CDBM and ICD is demonstrated in the paper through experiments on 22 benchmark functions from CEC-2019 and a real-world problem of signal timing optimization at road intersections. The research also reveals that compared to four other advanced multimodal multiobjective optimization algorithms, MMOP-AOA exhibits superior search capability and stability. Furthermore, MMOP-AOA utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs) and provides a theoretical framework for other metaheuristic optimization algorithms to tackle multimodal multiobjective problems.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101724"},"PeriodicalIF":8.2000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization\",\"authors\":\"Ruyue Zhang , Shuhua Mao , Shangrui Zhao , Chang Liu\",\"doi\":\"10.1016/j.swevo.2024.101724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Multimodal multiobjective optimization problems are widely prevalent in real life. Addressing these challenges is crucial as they directly impact the efficiency and effectiveness of solutions across various domains. This paper proposes a novel Multi-Modal Multi-Objective Arithmetic Optimization Algorithm (MMOP-AOA), aimed at achieving a high balance between diversity and convergence in both decision and objective spaces. Arithmetic Optimization Algorithm (AOA) is a highly competitive metaheuristic optimization algorithm with strong exploration and exploitation capabilities. MMOP-AOA extends the AOA for the first time to solve multimodal multiobjective problems, with the following ideas: Firstly, a new exploration and exploitation strategy (NBC<img>NEE) is designed based on the characteristics of AOA.The strategy utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs). Secondly, a convergence and diversity balance mechanism (CDBM) is developed. This mechanism involves comparing the convergence indicator and diversity indicator to select different mutation strategies. Thirdly, an improved crowding distance (ICD) is proposed to address the deficiencies of existing special crowding distance measures. The effectiveness of CDBM and ICD is demonstrated in the paper through experiments on 22 benchmark functions from CEC-2019 and a real-world problem of signal timing optimization at road intersections. The research also reveals that compared to four other advanced multimodal multiobjective optimization algorithms, MMOP-AOA exhibits superior search capability and stability. Furthermore, MMOP-AOA utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs) and provides a theoretical framework for other metaheuristic optimization algorithms to tackle multimodal multiobjective problems.</p></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"91 \",\"pages\":\"Article 101724\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-09-04\",\"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/S2210650224002621\",\"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/S2210650224002621","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization
Multimodal multiobjective optimization problems are widely prevalent in real life. Addressing these challenges is crucial as they directly impact the efficiency and effectiveness of solutions across various domains. This paper proposes a novel Multi-Modal Multi-Objective Arithmetic Optimization Algorithm (MMOP-AOA), aimed at achieving a high balance between diversity and convergence in both decision and objective spaces. Arithmetic Optimization Algorithm (AOA) is a highly competitive metaheuristic optimization algorithm with strong exploration and exploitation capabilities. MMOP-AOA extends the AOA for the first time to solve multimodal multiobjective problems, with the following ideas: Firstly, a new exploration and exploitation strategy (NBCNEE) is designed based on the characteristics of AOA.The strategy utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs). Secondly, a convergence and diversity balance mechanism (CDBM) is developed. This mechanism involves comparing the convergence indicator and diversity indicator to select different mutation strategies. Thirdly, an improved crowding distance (ICD) is proposed to address the deficiencies of existing special crowding distance measures. The effectiveness of CDBM and ICD is demonstrated in the paper through experiments on 22 benchmark functions from CEC-2019 and a real-world problem of signal timing optimization at road intersections. The research also reveals that compared to four other advanced multimodal multiobjective optimization algorithms, MMOP-AOA exhibits superior search capability and stability. Furthermore, MMOP-AOA utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs) and provides a theoretical framework for other metaheuristic optimization algorithms to tackle multimodal multiobjective problems.
期刊介绍:
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.