TBU Publications
Repository of TBU Publications

The initial study on the potential of super-sized swarm in PSO

DSpace Repository

Show simple item record

dc.title The initial study on the potential of super-sized swarm in PSO en
dc.contributor.author Pluháček, Michal
dc.contributor.author Šenkeřík, Roman
dc.contributor.author Zelinka, Ivan
dc.relation.ispartof Advances in Intelligent Systems and Computing
dc.relation.ispartof Mendel 2015: Recent Advances in Soft Computing
dc.identifier.issn 2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn 978-331919823-1
dc.identifier.isbn 978-3-319-19824-8
dc.date.issued 2015
utb.relation.volume 378
dc.citation.spage 127
dc.citation.epage 135
dc.event.title 21st International Conference on Soft Computing, Mendel 2015
dc.event.location Brno
utb.event.state-en Czech Republic
utb.event.state-cs Česká republika
dc.event.sdate 2015-06-23
dc.event.edate 2015-06-25
dc.type conferenceObject
dc.language.iso en
dc.publisher Springer Verlag
dc.identifier.doi 10.1007/978-3-319-19824-8_10
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-319-19824-8_10
dc.subject Particle swarm optimization en
dc.subject Population size en
dc.subject PSO en
dc.description.abstract In this initial study it is addressed the issue of population size for the PSO algorithm. For many years now it is understood that population size of several dozens is sufficient for the vast majority of optimization tasks. With strict limitation of cost function evaluations (CFEs) the setting is typically limited to adjusting the number of iterations of the algorithm. In this study it is investigated the possibility of using population of thousands of particles and its effect on the performance of the algorithm in limited CFEs. It is also proposed an alternative setting of acceleration constants in order to improve the performance of the PSO with super-sized population. The performance of the proposed method is tested on IEEE CEC 2013 benchmark set and compared with original PSO design and state of art methods. © Springer International Publishing Switzerland 2015. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1005770
utb.identifier.obdid 43874041
utb.identifier.scopus 2-s2.0-84946719518
utb.identifier.wok 000364847700010
utb.source d-scopus
dc.date.accessioned 2016-01-15T10:59:50Z
dc.date.available 2016-01-15T10:59:50Z
utb.contributor.internalauthor Pluháček, Michal
utb.contributor.internalauthor Šenkeřík, Roman
utb.fulltext.affiliation Michal Pluhacek, Roman Senkerik and Ivan Zelinka M. Pluhacek (✉) ⋅ R. Senkerik Faculty of Applied Informatics, Tomas Bata University in Zlin, Nam T.G. Masaryka 5555, 760 01 Zlin, Czech Republic e-mail: pluhacek@fai.utb.cz R. Senkerik e-mail: senkerik@fai.utb.cz I. Zelinka Faculty of Electrical Engineering and Computer Science, Technical University of Ostrava, 17. Listopadu 15, 708 33 Ostrava-Poruba, Czech Republic e-mail: ivan.zelinka@vsb.cz
utb.fulltext.dates -
utb.fulltext.sponsorship -
utb.fulltext.projects -
Find Full text

Files in this item

Show simple item record