基于群体协作的agent并行粒子群优化

Anshuman Satapathy, S. Satapathy, M. Reza
{"title":"基于群体协作的agent并行粒子群优化","authors":"Anshuman Satapathy, S. Satapathy, M. Reza","doi":"10.1109/INDICON.2014.7030486","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO) is a population-based evolutionary computation technique. The standard parallel Particle swarm optimization (PSO) is a promising scheme for solving NP-complete problems due to its fast convergence, fewer parameter settings and ability to fit dynamic environmental characteristics. A modified version of standard parallel particle swarm optimization algorithm named Agent-based Parallel PSO (PPSO) is presented to solve the large-scale optimization problem at a faster convergence rate. The new algorithm provides the information exchange among the particle sets which aims to accelerate the rate of convergence. Parallelization is based on the client-server model in which the particle set with global best value acts as a server and others are clients with agents in a single iteration. The agents contain the worst value information of respective particle set which they have to exchange with the global best value among particle sets in the swarm. The server is the center of data exchange, which deals with agents and manages the sharing of global best position among the individual clients by the replacement of worst position with global best position. The information exchange in particle sets has been done so that the new result will be the better as compared to previous result.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Agent-based parallel Particle swarm optimization based on group collaboration\",\"authors\":\"Anshuman Satapathy, S. Satapathy, M. Reza\",\"doi\":\"10.1109/INDICON.2014.7030486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle swarm optimization (PSO) is a population-based evolutionary computation technique. The standard parallel Particle swarm optimization (PSO) is a promising scheme for solving NP-complete problems due to its fast convergence, fewer parameter settings and ability to fit dynamic environmental characteristics. A modified version of standard parallel particle swarm optimization algorithm named Agent-based Parallel PSO (PPSO) is presented to solve the large-scale optimization problem at a faster convergence rate. The new algorithm provides the information exchange among the particle sets which aims to accelerate the rate of convergence. Parallelization is based on the client-server model in which the particle set with global best value acts as a server and others are clients with agents in a single iteration. The agents contain the worst value information of respective particle set which they have to exchange with the global best value among particle sets in the swarm. The server is the center of data exchange, which deals with agents and manages the sharing of global best position among the individual clients by the replacement of worst position with global best position. The information exchange in particle sets has been done so that the new result will be the better as compared to previous result.\",\"PeriodicalId\":409794,\"journal\":{\"name\":\"2014 Annual IEEE India Conference (INDICON)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Annual IEEE India Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON.2014.7030486\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Annual IEEE India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2014.7030486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

粒子群优化(PSO)是一种基于种群的进化计算技术。标准并行粒子群优化算法(PSO)具有收敛速度快、参数设置少、能够适应动态环境特征等优点,是求解np完全问题的一种很有前途的方法。为了以更快的收敛速度解决大规模优化问题,提出了一种改进的基于agent的并行粒子群优化算法。新算法提供了粒子集之间的信息交换,从而加快了收敛速度。并行化基于客户机-服务器模型,其中具有全局最优值的粒子集充当服务器,其他粒子集在单个迭代中充当具有代理的客户端。agent包含各自粒子集的最差值信息,它们必须与群体中粒子集的全局最优值进行交换。服务器是数据交换的中心,它与代理进行交互,并通过将最差位置替换为全局最佳位置来管理各个客户端之间的全局最佳位置共享。在粒子集上进行了信息交换,使得新结果比以前的结果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Agent-based parallel Particle swarm optimization based on group collaboration
Particle swarm optimization (PSO) is a population-based evolutionary computation technique. The standard parallel Particle swarm optimization (PSO) is a promising scheme for solving NP-complete problems due to its fast convergence, fewer parameter settings and ability to fit dynamic environmental characteristics. A modified version of standard parallel particle swarm optimization algorithm named Agent-based Parallel PSO (PPSO) is presented to solve the large-scale optimization problem at a faster convergence rate. The new algorithm provides the information exchange among the particle sets which aims to accelerate the rate of convergence. Parallelization is based on the client-server model in which the particle set with global best value acts as a server and others are clients with agents in a single iteration. The agents contain the worst value information of respective particle set which they have to exchange with the global best value among particle sets in the swarm. The server is the center of data exchange, which deals with agents and manages the sharing of global best position among the individual clients by the replacement of worst position with global best position. The information exchange in particle sets has been done so that the new result will be the better as compared to previous result.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信