{"title":"A Multi-Subpopulation Accelerating Particle Swarm Optimization","authors":"Yi Jiang","doi":"10.1109/WKDD.2008.69","DOIUrl":null,"url":null,"abstract":"The particle swarm optimization is a stochastic, population-based optimization technique that can be applied to a wide range of problems. A multi- subpopulation accelerating particle swarm optimization(MAPSO)is proposed to improve the performance of the original algorithm. MAPSO views the excellent individuals as attractors and generates local small populations in the neighbor of them to maintain the diversity of the population. In the course of searching, MAPSO constantly shrinks the searching neighbor and uses the accelerating operators to speed up the evolution of MAPSO. Finally, MAPSO's efficiency is validated through optimization of benchmark functions.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"4 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WKDD.2008.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The particle swarm optimization is a stochastic, population-based optimization technique that can be applied to a wide range of problems. A multi- subpopulation accelerating particle swarm optimization(MAPSO)is proposed to improve the performance of the original algorithm. MAPSO views the excellent individuals as attractors and generates local small populations in the neighbor of them to maintain the diversity of the population. In the course of searching, MAPSO constantly shrinks the searching neighbor and uses the accelerating operators to speed up the evolution of MAPSO. Finally, MAPSO's efficiency is validated through optimization of benchmark functions.