Abstract
Particle Swarm Optimization (PSO) has been widely used to solve many di.erent real world optimization problems. Many novel PSO approaches have been proposed to improve the PSO performance. Recently, a communication topology based on Clans was proposed. In this paper, we propose the Dynamic Clan PSO topology. In this approach, a novel ability is included in the Clan Topology, named migration process. The goal is to improve the PSO degree of convergence focusing on the distribution of the particles in the search space. A comparison with the Original Clan topology and other well known topologies was performed and our results in five benchmark functions have shown that the changes can provide better results, except for the Rastrigin function.
Original language | English |
---|---|
Title of host publication | 2009 Ninth International Conference on Intelligent Systems Design and Applications |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 249-254 |
Number of pages | 6 |
ISBN (Print) | 978-1-4244-4735-0 |
DOIs | |
Publication status | Published - 28 Dec 2009 |
Externally published | Yes |
Event | 9th International Conference on Intelligent Systems Design and Applications, ISDA 2009 - Pisa, Italy Duration: 30 Nov 2009 → 2 Dec 2009 Conference number: 9 |
Conference
Conference | 9th International Conference on Intelligent Systems Design and Applications, ISDA 2009 |
---|---|
Abbreviated title | ISDA |
Country/Territory | Italy |
City | Pisa |
Period | 30/11/09 → 2/12/09 |