基于柯西变异和改进拥挤距离的多目标粒子群优化算法

Qingxia Li, Xiaohua Zeng, Wenhong Wei
{"title":"基于柯西变异和改进拥挤距离的多目标粒子群优化算法","authors":"Qingxia Li, Xiaohua Zeng, Wenhong Wei","doi":"10.1108/ijicc-04-2022-0118","DOIUrl":null,"url":null,"abstract":"PurposeMulti-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.Design/methodology/approachIn this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.FindingsIn order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.Originality/valueIn order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.","PeriodicalId":352072,"journal":{"name":"Int. J. Intell. Comput. Cybern.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective particle swarm optimization algorithm using Cauchy mutation and improved crowding distance\",\"authors\":\"Qingxia Li, Xiaohua Zeng, Wenhong Wei\",\"doi\":\"10.1108/ijicc-04-2022-0118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PurposeMulti-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.Design/methodology/approachIn this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.FindingsIn order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.Originality/valueIn order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.\",\"PeriodicalId\":352072,\"journal\":{\"name\":\"Int. J. Intell. Comput. Cybern.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Intell. Comput. Cybern.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijicc-04-2022-0118\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Intell. Comput. Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijicc-04-2022-0118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多目标是现实生活中出现的一个复杂的问题,而这些目标是相互冲突的。群体智能算法通常用于解决这类多目标问题。由于粒子群算法具有较强的搜索能力和收敛能力,提出了粒子群优化算法,并采用多目标粒子群优化算法解决多目标优化问题。然而,粒子群算法的粒子由于收敛速度快,容易陷入局部寻优。多目标粒子群算法的Pareto前沿算法存在分布不均匀和多样性差的问题。为此,本文提出了一种改进的多目标粒子群优化算法,该算法采用自适应柯西突变和改进的拥挤距离。本文提出的算法采用自适应柯西突变和改进的拥挤距离对种群中的粒子进行动态扰动,使陷入局部优化的粒子跳出来,从而提高了收敛性能。为了解决多目标粒子群优化算法中Pareto前沿分布不均匀和多样性差的问题,本文采用自适应柯西突变和改进拥挤距离的方法,帮助被困在局部优化中的粒子跳出局部优化。实验结果表明,与其他多目标优化算法相比,该算法在9个基准函数的收敛性能上具有明显优势。为了帮助被困在局部优化中的粒子跳出局部优化,从而提高收敛性能,本文提出了一种改进的多目标粒子群优化算法,该算法采用自适应柯西突变和改进的拥挤距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective particle swarm optimization algorithm using Cauchy mutation and improved crowding distance
PurposeMulti-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.Design/methodology/approachIn this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.FindingsIn order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.Originality/valueIn order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信