An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ruyue Zhang , Shuhua Mao , Shangrui Zhao , Chang Liu
{"title":"An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization","authors":"Ruyue Zhang ,&nbsp;Shuhua Mao ,&nbsp;Shangrui Zhao ,&nbsp;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}
引用次数: 0

Abstract

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.

用于多模式多目标优化的具有均衡多样性和收敛性的算术优化算法
多模式多目标优化问题在现实生活中广泛存在。应对这些挑战至关重要,因为它们直接影响到各个领域解决方案的效率和效果。本文提出了一种新颖的多模式多目标算术优化算法(MMOP-AOA),旨在实现决策空间和目标空间的多样性与收敛性之间的高度平衡。算术优化算法(AOA)是一种极具竞争力的元启发式优化算法,具有很强的探索和利用能力。MMOP-AOA 首次将 AOA 扩展到解决多模态多目标问题,其思路如下:该策略利用基于邻域的聚类(NBC)将决策空间划分为多个聚类,帮助 MMOP-AOA 捕获更多等效帕累托子集(ePS)。其次,还开发了收敛和多样性平衡机制(CDBM)。该机制通过比较收敛指标和多样性指标来选择不同的突变策略。第三,针对现有特殊拥挤距离测量方法的不足,提出了改进的拥挤距离(ICD)。论文通过对 CEC-2019 的 22 个基准函数和道路交叉口信号配时优化的实际问题进行实验,证明了 CDBM 和 ICD 的有效性。研究还表明,与其他四种先进的多模式多目标优化算法相比,MMOP-AOA 表现出更出色的搜索能力和稳定性。此外,MMOP-AOA 利用基于邻域的聚类(NBC)将决策空间划分为多个聚类,帮助 MMOP-AOA 捕获更多等效帕累托子集(ePS),并为其他元启发式优化算法解决多模式多目标问题提供了理论框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信