A new Algorithm based on the Gbest of Particle Swarm Optimization algorithm to improve Estimation of Distribution Algorithm

Qiuyue Zhao, Ying Gao
{"title":"A new Algorithm based on the Gbest of Particle Swarm Optimization algorithm to improve Estimation of Distribution Algorithm","authors":"Qiuyue Zhao, Ying Gao","doi":"10.1109/ICSCEE.2018.8538372","DOIUrl":null,"url":null,"abstract":"In recent years, with the rise of artificial intelligence and deep learning, as an evolutionary algorithm based on probability model, estimation of distribution algorithm has been widely research and development. The estimation of distribution algorithm without the traditional genetic operation such as crossover and mutation, is a new kind of evolution model. As an algorithm based on probabilistic mode, the estimation of distribution algorithm establishes a probabilistic model describing the solution space of optimization problems. With the emergence for big data, the convergence of the algorithm and the requirements for solving precision are also increasing. This paper attempts to improve the distribution estimation algorithm. The optimal population of each iteration is found through the location update of each iteration of the Particle Swarm Optimization (PSO) algorithm. The simulation test was carried out with ten benchmark test function. The proposed algorithm was compared with the GA_EDA9improved genetic algorithm) and the basic distribution estimation (EDA) algorithm. Experimental results show that the new algorithm is superior to GA_EDA and basic EDA in terms of convergence and accuracy.","PeriodicalId":265737,"journal":{"name":"2018 International Conference on Smart Computing and Electronic Enterprise (ICSCEE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Smart Computing and Electronic Enterprise (ICSCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCEE.2018.8538372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent years, with the rise of artificial intelligence and deep learning, as an evolutionary algorithm based on probability model, estimation of distribution algorithm has been widely research and development. The estimation of distribution algorithm without the traditional genetic operation such as crossover and mutation, is a new kind of evolution model. As an algorithm based on probabilistic mode, the estimation of distribution algorithm establishes a probabilistic model describing the solution space of optimization problems. With the emergence for big data, the convergence of the algorithm and the requirements for solving precision are also increasing. This paper attempts to improve the distribution estimation algorithm. The optimal population of each iteration is found through the location update of each iteration of the Particle Swarm Optimization (PSO) algorithm. The simulation test was carried out with ten benchmark test function. The proposed algorithm was compared with the GA_EDA9improved genetic algorithm) and the basic distribution estimation (EDA) algorithm. Experimental results show that the new algorithm is superior to GA_EDA and basic EDA in terms of convergence and accuracy.
基于粒子群优化算法的Gbest改进了分布估计算法
近年来,随着人工智能和深度学习的兴起,分布估计算法作为一种基于概率模型的进化算法得到了广泛的研究和发展。分布估计算法省去了传统的交叉、变异等遗传操作,是一种新型的进化模型。分布估计算法是一种基于概率模式的算法,它建立了一个描述优化问题解空间的概率模型。随着大数据的出现,算法的收敛性和对求解精度的要求也越来越高。本文试图对分布估计算法进行改进。通过粒子群优化(PSO)算法每次迭代的位置更新,找到每次迭代的最优种群。采用10个基准测试函数进行仿真测试。将该算法与ga_eda9(改进遗传算法)和基本分布估计(EDA)算法进行了比较。实验结果表明,新算法在收敛性和精度上都优于GA_EDA和basic EDA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信