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 conv...
| Published in: | Conference on Data Mining and Optimization |
|---|---|
| Main Author: | |
| Format: | Conference paper |
| Language: | English |
| Published: |
2012
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869433380&doi=10.1109%2fDMO.2012.6329802&partnerID=40&md5=af0013c69589f5e4eb7c0369ad890918 |
| id |
2-s2.0-84869433380 |
|---|---|
| spelling |
2-s2.0-84869433380 Imran M.; Hashim R.; Khalid N.E.A. Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) 2012 Conference on Data Mining and Optimization 10.1109/DMO.2012.6329802 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869433380&doi=10.1109%2fDMO.2012.6329802&partnerID=40&md5=af0013c69589f5e4eb7c0369ad890918 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. © 2012 IEEE. 21556946 English Conference paper |
| author |
Imran M.; Hashim R.; Khalid N.E.A. |
| spellingShingle |
Imran M.; Hashim R.; Khalid N.E.A. Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| author_facet |
Imran M.; Hashim R.; Khalid N.E.A. |
| author_sort |
Imran M.; Hashim R.; Khalid N.E.A. |
| title |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| title_short |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| title_full |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| title_fullStr |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| title_full_unstemmed |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| title_sort |
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO) |
| publishDate |
2012 |
| container_title |
Conference on Data Mining and Optimization |
| container_volume |
|
| container_issue |
|
| doi_str_mv |
10.1109/DMO.2012.6329802 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869433380&doi=10.1109%2fDMO.2012.6329802&partnerID=40&md5=af0013c69589f5e4eb7c0369ad890918 |
| description |
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. © 2012 IEEE. |
| publisher |
|
| issn |
21556946 |
| language |
English |
| format |
Conference paper |
| accesstype |
|
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1818940564166410240 |