PSO算法在大规模优化问题中一种新的选择策略的性能研究

2013 IEEE Congress on Evolutionary Computation Pub Date : 2013-06-20 DOI:10.1109/CEC.2013.6557805

Michal Pluhacek, R. Šenkeřík, I. Zelinka

{"title":"PSO算法在大规模优化问题中一种新的选择策略的性能研究","authors":"Michal Pluhacek, R. Šenkeřík, I. Zelinka","doi":"10.1109/CEC.2013.6557805","DOIUrl":null,"url":null,"abstract":"In this paper, a novel strategy for particle swarm optimization is presented and investigated over its ability to improve the performance of PSO algorithm in the task of large scale optimization problems. This proposed strategy alters the way the velocity of each particle is determined. Promising results of this innovative strategy are presented in the results section and briefly analyzed.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Investigation on the performance of a new multiple choice strategy for PSO Algorithm in the task of large scale optimization problems\",\"authors\":\"Michal Pluhacek, R. Šenkeřík, I. Zelinka\",\"doi\":\"10.1109/CEC.2013.6557805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel strategy for particle swarm optimization is presented and investigated over its ability to improve the performance of PSO algorithm in the task of large scale optimization problems. This proposed strategy alters the way the velocity of each particle is determined. Promising results of this innovative strategy are presented in the results section and briefly analyzed.\",\"PeriodicalId\":211988,\"journal\":{\"name\":\"2013 IEEE Congress on Evolutionary Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2013.6557805\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

本文提出了一种新的粒子群优化策略，并研究了其在大规模优化问题中改进粒子群算法性能的能力。这个提议的策略改变了确定每个粒子速度的方法。结果部分介绍了这一创新策略的有希望的结果，并对其进行了简要分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Investigation on the performance of a new multiple choice strategy for PSO Algorithm in the task of large scale optimization problems

In this paper, a novel strategy for particle swarm optimization is presented and investigated over its ability to improve the performance of PSO algorithm in the task of large scale optimization problems. This proposed strategy alters the way the velocity of each particle is determined. Promising results of this innovative strategy are presented in the results section and briefly analyzed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 IEEE Congress on Evolutionary Computation

自引率

0.00%

发文量