Abstract
Particle swarm optimization (PSO) is a metaheuristic algorithm that is easy to implement and performs well on various optimization problems. However, PSO is sensitive to initialization due to its rapid convergence which leads to the lack of population diversity and premature convergence. To solve this problem, a jumping-out strategy named crown jewel defense (CJD) is introduced in this paper. CJD is used to relocate the global best position and reinitializes all particles' personal best position when the swarm is trapped in local optima. Taking the advantage of CJD strategy, the swarm can jump out of the local optimal region without being dragged back and the performance of PSO becomes more robust to the initialization. Experimental results on benchmark functions show that the CJD-based PSO are comparable to or better than the other representative state-of-the-art PSO.
Original language | English |
---|---|
Title of host publication | 2012 IEEE Congress on Evolutionary Computation, CEC 2012 |
DOIs | |
Publication status | Published - 2012 |
Event | 2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, Australia Duration: 10 Jun 2012 → 15 Jun 2012 |
Publication series
Name | 2012 IEEE Congress on Evolutionary Computation, CEC 2012 |
---|
Conference
Conference | 2012 IEEE Congress on Evolutionary Computation, CEC 2012 |
---|---|
Country/Territory | Australia |
City | Brisbane, QLD |
Period | 10/06/12 → 15/06/12 |
Bibliographical note
Copyright:Copyright 2012 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Theoretical Computer Science