{"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":"175 1","pages":"0"},"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\":\"175 1\",\"pages\":\"0\"},\"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}
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.