Chaos PSO with super-sized swarm—initial study

Pluháček, Michal; Šenkeřík, Roman; Zelinka, Ivan

dc.title	Chaos PSO with super-sized swarm—initial study	en
dc.contributor.author	Pluháček, Michal
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Zelinka, Ivan
dc.relation.ispartof	Proceedings of the Second International Afro-European Conference for Industrial Advancement (AECIA 2015)
dc.relation.ispartof	Advances in Intelligent Systems and Computing
dc.identifier.issn	2194-5357 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn	9783319295039
dc.date.issued	2016
utb.relation.volume	427
dc.citation.spage	527
dc.citation.epage	535
dc.event.title	2nd International Afro-European Conference for Industrial Advancement, AECIA 2015
dc.event.location	Villejuif
utb.event.state-en	France
utb.event.state-cs	Francie
dc.event.sdate	2015-09-09
dc.event.edate	2015-09-11
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	Springer Verlag
dc.identifier.doi	10.1007/978-3-319-29504-6_49
dc.relation.uri	https://link.springer.com/chapter/10.1007/978-3-319-29504-6_49
dc.subject	Chaos	en
dc.subject	Evolutionary algorithm	en
dc.subject	Optimization	en
dc.subject	Particle swarm optimization	en
dc.subject	PSO	en
dc.description.abstract	In this paper it is investigated the possibility of improving the performance of PSO algorithm with super-sized population. The performance fo canonical PSO with super-sized swarm has been investigated previously and showed promising results. In this study four different chaotic systems are used as pseudo-random number generators for the PSO algorithm. The IEEE CEC’13 benchmark set is used to evaluate the performance of the method. © Springer International Publishing Switzerland 2016.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1006257
utb.identifier.rivid	RIV/70883521:28140/16:43875434!RIV17-GA0-28140___
utb.identifier.obdid	43876180
utb.identifier.scopus	2-s2.0-84958292018
utb.identifier.wok	000371912400049
utb.source	d-scopus
dc.date.accessioned	2016-04-28T10:53:14Z
dc.date.available	2016-04-28T10:53:14Z
utb.contributor.internalauthor	Pluháček, Michal
utb.contributor.internalauthor	Šenkeřík, Roman
utb.contributor.internalauthor	Zelinka, Ivan
utb.fulltext.affiliation	Michal Pluhacek, Roman Senkerik and Ivan Zelinka M. Pluhacek ( ✉ ) ⋅ R. Senkerik Faculty of Applied Informatics, Tomas Bata University in Zlin, T.G. Masaryka 5555, 760 01 Zlín, 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, VŠB-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	This work was supported by Grant Agency of the Czech Republic—GACR P103/15/06700S, further by financial support of research project NPU I No. MSMT-7778/2014 by the Ministry of Education of the Czech Republic and also by the European Regional Development Fund under the Project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089, partially supported by Grant of SGS No. SP2015/142 of VSB-Technical University of Ostrava, Czech Republic and by Internal Grant Agency of Tomas Bata University under the projects No. IGA/FAI/2015/057.