简化粒子群优化算法的最小粒子数研究

2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) Pub Date : 2011-05-19 DOI:10.1109/SACI.2011.5873018

Andrei Lihu, S. Holban

{"title":"简化粒子群优化算法的最小粒子数研究","authors":"Andrei Lihu, S. Holban","doi":"10.1109/SACI.2011.5873018","DOIUrl":null,"url":null,"abstract":"Recent research on particle swarm optimization (PSO) emphasizes the need to simply this algorithm. This paper is a short study on finding the minimal number of particles in a simplified PSO. We have taken into consideration a social-only variant, Pedersen's simplified PSO, and tested it with four popular optimization benchmark functions in order to discover which is the minimal number of particles that can be used in most optimization problems.","PeriodicalId":334381,"journal":{"name":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A study on the minimal number of particles for a simplified particle swarm optimization algorithm\",\"authors\":\"Andrei Lihu, S. Holban\",\"doi\":\"10.1109/SACI.2011.5873018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent research on particle swarm optimization (PSO) emphasizes the need to simply this algorithm. This paper is a short study on finding the minimal number of particles in a simplified PSO. We have taken into consideration a social-only variant, Pedersen's simplified PSO, and tested it with four popular optimization benchmark functions in order to discover which is the minimal number of particles that can be used in most optimization problems.\",\"PeriodicalId\":334381,\"journal\":{\"name\":\"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SACI.2011.5873018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI.2011.5873018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

近年来在粒子群优化(PSO)方面的研究强调了简化该算法的必要性。本文是一篇关于寻找简化粒子群中最小粒子数的简短研究。我们考虑了一个只针对社会的变体，Pedersen的简化粒子群，并用四种流行的优化基准函数对其进行测试，以发现在大多数优化问题中可以使用的最小粒子数。

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

查看原文本刊更多论文

A study on the minimal number of particles for a simplified particle swarm optimization algorithm

Recent research on particle swarm optimization (PSO) emphasizes the need to simply this algorithm. This paper is a short study on finding the minimal number of particles in a simplified PSO. We have taken into consideration a social-only variant, Pedersen's simplified PSO, and tested it with four popular optimization benchmark functions in order to discover which is the minimal number of particles that can be used in most optimization problems.

求助全文

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

来源期刊

2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)

自引率

0.00%

发文量