Contact Us | Language: čeština English
Title: | PSO with attractive search space border points | ||||||||||
Author: | Pluháček, Michal; Šenkeřík, Roman; Viktorin, Adam; Kadavý, Tomáš | ||||||||||
Document type: | Conference paper (English) | ||||||||||
Source document: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017, vol. 10246 LNAI, p. 665-675 | ||||||||||
ISSN: | 0302-9743 (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-3-319-59059-2 | ||||||||||
DOI: | https://doi.org/10.1007/978-3-319-59060-8_60 | ||||||||||
Abstract: | One of the biggest drawbacks of the original Particle Swarm Optimization is the premature convergence and fast loss of diversity in the population. In this paper, we propose and discuss a simple yet effective modification to help the PSO maintain diversity and avoid premature convergence. The particles are randomly attracted towards the border points of the search space. We use the CEC13 Benchmark function set to test the performance of proposed method and compare it to original PSO. © Springer International Publishing AG 2017. | ||||||||||
Full text: | https://link.springer.com/chapter/10.1007/978-3-319-59060-8_60 | ||||||||||
Show full item record |