{"title":"基于对立的学生T突变粒子群优化算法","authors":"M. Imran, R. Hashim, Noor Elaiza Abd Khalid","doi":"10.1109/DMO.2012.6329802","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO) is a stochastic algorithm, used for the optimization problems, proposed by Kennedy [1] in 1995. PSO is a recognized algorithm for optimization problems, but suffers from premature convergence. This paper presents an Opposition-based PSO (OPSO) to accelerate the convergence of PSO and at the same time, avoid early convergence. The proposed OPSO method is coupled with the student T mutation. Results from the experiment performed on the standard benchmark functions show an improvement on the performance of PSO.","PeriodicalId":330241,"journal":{"name":"2012 4th Conference on Data Mining and Optimization (DMO)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Opposition based Particle Swarm Optimization with student T mutation (OSTPSO)\",\"authors\":\"M. Imran, R. Hashim, Noor Elaiza Abd Khalid\",\"doi\":\"10.1109/DMO.2012.6329802\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle swarm optimization (PSO) is a stochastic algorithm, used for the optimization problems, proposed by Kennedy [1] in 1995. PSO is a recognized algorithm for optimization problems, but suffers from premature convergence. This paper presents an Opposition-based PSO (OPSO) to accelerate the convergence of PSO and at the same time, avoid early convergence. The proposed OPSO method is coupled with the student T mutation. Results from the experiment performed on the standard benchmark functions show an improvement on the performance of PSO.\",\"PeriodicalId\":330241,\"journal\":{\"name\":\"2012 4th Conference on Data Mining and Optimization (DMO)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 4th Conference on Data Mining and Optimization (DMO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMO.2012.6329802\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 4th Conference on Data Mining and Optimization (DMO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMO.2012.6329802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO)
Particle swarm optimization (PSO) is a stochastic algorithm, used for the optimization problems, proposed by Kennedy [1] in 1995. PSO is a recognized algorithm for optimization problems, but suffers from premature convergence. This paper presents an Opposition-based PSO (OPSO) to accelerate the convergence of PSO and at the same time, avoid early convergence. The proposed OPSO method is coupled with the student T mutation. Results from the experiment performed on the standard benchmark functions show an improvement on the performance of PSO.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
