A Many-Objective Practical Swarm Optimization Based on Mixture Uniform Design and Game Mechanism

Pub Date : 2022-01-01 DOI:10.4018/ijcini.301203
Chen Yan, Cai Mengxiang, Zheng Mingyong, Kangshun Li
{"title":"A Many-Objective Practical Swarm Optimization Based on Mixture Uniform Design and Game Mechanism","authors":"Chen Yan, Cai Mengxiang, Zheng Mingyong, Kangshun Li","doi":"10.4018/ijcini.301203","DOIUrl":null,"url":null,"abstract":"In recent years, multi-objective optimization algorithms, especially many-objective optimization algorithms, have developed rapidly and effectively.Among them, the algorithm based on particle swarm optimization has the characteristics of simple principle, few parameters and easy implementation. However, these algorithms still have some shortcomings, but also face the problems of falling into the local optimal solution, slow convergence speed and so on. In order to solve these problems, this paper proposes an algorithm called MUD-GMOPSO, A Many-Objective Practical Swarm Optimization based on Mixture Uniform Design and Game mechanism. In this paper, the two improved methods are combined, and the convergence speed, accuracy and robustness of the algorithm are greatly improved. In addition, the experimental results show that the algorithm has better performance than the four latest multi-objective or high-dimensional multi-objective optimization algorithms on three widely used benchmarks: DTLZ, WFG and MAF.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcini.301203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, multi-objective optimization algorithms, especially many-objective optimization algorithms, have developed rapidly and effectively.Among them, the algorithm based on particle swarm optimization has the characteristics of simple principle, few parameters and easy implementation. However, these algorithms still have some shortcomings, but also face the problems of falling into the local optimal solution, slow convergence speed and so on. In order to solve these problems, this paper proposes an algorithm called MUD-GMOPSO, A Many-Objective Practical Swarm Optimization based on Mixture Uniform Design and Game mechanism. In this paper, the two improved methods are combined, and the convergence speed, accuracy and robustness of the algorithm are greatly improved. In addition, the experimental results show that the algorithm has better performance than the four latest multi-objective or high-dimensional multi-objective optimization algorithms on three widely used benchmarks: DTLZ, WFG and MAF.
分享
查看原文
基于混合均匀设计和博弈机制的多目标实用群优化
近年来,多目标优化算法,特别是多目标优化算法得到了迅速而有效的发展。其中,基于粒子群优化的算法具有原理简单、参数少、易于实现的特点。但是,这些算法仍然存在一些不足,也面临着陷入局部最优解、收敛速度慢等问题。为了解决这些问题,本文提出了一种基于混合均匀设计和博弈机制的多目标实用群优化算法MUD-GMOPSO。本文将两种改进方法结合起来,大大提高了算法的收敛速度、精度和鲁棒性。此外,实验结果表明,该算法在DTLZ、WFG和MAF三个广泛使用的基准上,比四种最新的多目标或高维多目标优化算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
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学术官方微信