Muchamad Taufiq, Anwar and Edy, Winarno and Iswatun, Chasanah and Saptono, Nugrohadi A NOVEL AND FAST MEMORY PERTURBATION METHOD TO INCREASE EXPLORATION IN PARTICLE SWARM OPTIMIZATION ALGORITHM. Publisher.
![[img]](http://eprints.unisbank.ac.id/style/images/fileicons/application_pdf.png) |
PDF
Download (2MB) |
Abstract
Particle Swarm Optimization (PSO), one of the versatile nature-inspired optimization algorithm, continue to suffer from premature convergence despite the numerous amount of research trying to improve this algorithm. Many research had tried to address this issue but often use a complex algorithm which tax on computational time and complexity. This research introduced a novel perturbation method to mitigate premature convergence / to increase exploration while keeping the computational cost at a minimum. The particles' memories (i.e the position of personal and global best) are modified by a random multiplier which in turn will ‘perturb’ the particles’ velocity. The implementation of this novel perturbation method in early iterations had resulted in 100% success rate in finding global optima in multimodal benchmark tests including the Rastrigin problem – whereas the original PSO failed in all benchmark tests – without adding a significant amount of computational complexity and time.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Faculty / Institution: | Fakultas Teknologi Informasi |
| Depositing User: | Jati Sasongko Wibowo |
| Date Deposited: | 09 Dec 2019 20:21 |
| Last Modified: | 09 Dec 2019 20:21 |
| URI: | https://eprints.unisbank.ac.id/id/eprint/6314 |
Actions (login required)
 |
View Item |
