A new and improved version of particle swarm optimization algorithm with global–local best parameters
This paper presents a new and improved version of particle swarm optimization algorithm (PSO) combining the global best and local best model, termed GLBest-PSO. The GLBest-PSO incorporates global-local best inertia weight (GLBest IW) with global-local best acceleration coefficient (GLBest Ac). The v...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SPRINGER LONDON LTD
2008
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2278/ http://shdl.mmu.edu.my/2278/1/735.pdf |
| _version_ | 1848790013032005632 |
|---|---|
| author | Senthil Arumugam, M. Rao, M. V. C. Chandramohan, Aarthi |
| author_facet | Senthil Arumugam, M. Rao, M. V. C. Chandramohan, Aarthi |
| author_sort | Senthil Arumugam, M. |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | This paper presents a new and improved version of particle swarm optimization algorithm (PSO) combining the global best and local best model, termed GLBest-PSO. The GLBest-PSO incorporates global-local best inertia weight (GLBest IW) with global-local best acceleration coefficient (GLBest Ac). The velocity equation of the GLBest-PSO is also simplified. The ability of the GLBest-PSO is tested with a set of bench mark problems and the results are compared with those obtained through conventional PSO (cPSO), which uses time varying inertia weight (TVIW) and acceleration coefficient (TVAC). Fine tuning variants such as mutation, cross-over and RMS variants are also included with both cPSO and GLBest-PSO to improve the performance. The simulation results clearly elucidate the advantage of the fine tuning variants, which sharpen the convergence and tune to the best solution for both cPSO and GLBest-PSO. To compare and verify the validity and effectiveness of the GLBest-PSO, a number of statistical analyses are carried out. It is also observed that the convergence speed of GLBest-PSO is considerably higher than cPSO. All the results clearly demonstrate the superiority of the GLBest-PSO. |
| first_indexed | 2025-11-14T18:05:51Z |
| format | Article |
| id | mmu-2278 |
| institution | Multimedia University |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:05:51Z |
| publishDate | 2008 |
| publisher | SPRINGER LONDON LTD |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-22782011-09-09T03:32:18Z http://shdl.mmu.edu.my/2278/ A new and improved version of particle swarm optimization algorithm with global–local best parameters Senthil Arumugam, M. Rao, M. V. C. Chandramohan, Aarthi T Technology (General) QA75.5-76.95 Electronic computers. Computer science This paper presents a new and improved version of particle swarm optimization algorithm (PSO) combining the global best and local best model, termed GLBest-PSO. The GLBest-PSO incorporates global-local best inertia weight (GLBest IW) with global-local best acceleration coefficient (GLBest Ac). The velocity equation of the GLBest-PSO is also simplified. The ability of the GLBest-PSO is tested with a set of bench mark problems and the results are compared with those obtained through conventional PSO (cPSO), which uses time varying inertia weight (TVIW) and acceleration coefficient (TVAC). Fine tuning variants such as mutation, cross-over and RMS variants are also included with both cPSO and GLBest-PSO to improve the performance. The simulation results clearly elucidate the advantage of the fine tuning variants, which sharpen the convergence and tune to the best solution for both cPSO and GLBest-PSO. To compare and verify the validity and effectiveness of the GLBest-PSO, a number of statistical analyses are carried out. It is also observed that the convergence speed of GLBest-PSO is considerably higher than cPSO. All the results clearly demonstrate the superiority of the GLBest-PSO. SPRINGER LONDON LTD 2008 Article NonPeerReviewed application/pdf en http://shdl.mmu.edu.my/2278/1/735.pdf Senthil Arumugam, M. and Rao, M. V. C. and Chandramohan, Aarthi (2008) A new and improved version of particle swarm optimization algorithm with global–local best parameters. Knowledge and Information Systems, 16 (3). pp. 331-357. ISSN 0219-1377 http://dx.doi.org/10.1007/s10115-007-0109-z doi:10.1007/s10115-007-0109-z doi:10.1007/s10115-007-0109-z |
| spellingShingle | T Technology (General) QA75.5-76.95 Electronic computers. Computer science Senthil Arumugam, M. Rao, M. V. C. Chandramohan, Aarthi A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title | A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title_full | A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title_fullStr | A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title_full_unstemmed | A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title_short | A new and improved version of particle swarm optimization algorithm with global–local best parameters |
| title_sort | new and improved version of particle swarm optimization algorithm with global–local best parameters |
| topic | T Technology (General) QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2278/ http://shdl.mmu.edu.my/2278/ http://shdl.mmu.edu.my/2278/ http://shdl.mmu.edu.my/2278/1/735.pdf |