Multiple choice strategy for PSO algorithm - Performance analysis on shifted test functions

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

dc.title	Multiple choice strategy for PSO algorithm - Performance analysis on shifted test functions	en
dc.contributor.author	Pluháček, Michal
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Zelinka, Ivan
dc.contributor.author	Davendra, Donald David
dc.relation.ispartof	Proceedings 27th European Conference on Modelling and Simulation ECMS 2013
dc.identifier.isbn	978-0-9564944-6-7
dc.date.issued	2013
dc.citation.spage	393
dc.citation.epage	397
dc.event.title	27th European Conference on Modelling and Simulation, ECMS 2013
dc.event.location	Alesund
utb.event.state-en	Norway
utb.event.state-cs	Norsko
dc.event.sdate	2013-05-27
dc.event.edate	2013-05-30
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	European Council for Modelling and Simulation (ECMS)
dc.identifier.doi	10.7148/2013-0393
dc.relation.uri	http://www.scs-europe.net/dlib/2013/2013-0393.htm
dc.relation.uri	http://www.scs-europe.net/dlib/2013/ecms13papers/is_ECMS2013_0179.pdf
dc.subject	PSO	en
dc.subject	Optimization	en
dc.subject	Evolutionary Algorithms	en
dc.subject	Swarm intelligence	en
dc.subject	Shifted test functions	en
dc.description.abstract	A new promising strategy for the PSO (Particle swarm optimization) algorithm is proposed and described in this paper. This new strategy presents alternative way of assigning new velocity to each individual in particle swarm (population). This new multiple choice particle swarm optimization (MC-PSO) algorithm is tested on two different shifted test functions to show the performance on problems that are not constant in time. The promising results of this alternative strategy are compared with the not modified PSO version.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1003823
utb.identifier.obdid	43870633
utb.identifier.scopus	2-s2.0-84899026724
utb.identifier.wok	000337114500060
utb.source	d-wok
dc.date.accessioned	2014-08-05T09:56:34Z
dc.date.available	2014-08-05T09:56:34Z
utb.contributor.internalauthor	Pluháček, Michal
utb.contributor.internalauthor	Šenkeřík, Roman
utb.contributor.internalauthor	Zelinka, Ivan
utb.fulltext.affiliation	1 Michal Pluhacek, 1 Roman Senkerik, 1 Ivan Zelinka and 2 Donald Davendra 1 Tomas Bata University in Zlin , Faculty of Applied Informatics Nam T.G. Masaryka 5555, 760 01 Zlin, Czech Republic {pluhacek,senkerik,zelinka}@fai.utb.cz 2 Department of Computer Science, Faculty of Electrical Engineering and Computer Science , VB-TUO, 17. listopadu 15, 708 33 Ostrava-Poruba, Czech Republic donald.davendra@vsb.cz
utb.fulltext.dates	-
utb.fulltext.sponsorship	This work was supported by Grant Agency of the Czech Republic—GACR P103/13/08195S, by the project Development of human resources in research and development of latest soft computing methods and their application in practice, reg. no. CZ.1.07/2.3.00/20.0072 funded by Operational Programme Education for Competitiveness, co-financed by ESF and state budget of the Czech Republic; European Regional Development Fund under the project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089; by the Technology Agency of the Czech Republic under the Project TE01020197; and by Internal Grant Agency of Tomas Bata University under the project No. IGA/FAI/2013/012.
utb.fulltext.projects	GACR P103/13/08195S
utb.fulltext.projects	CZ.1.07/2.3.00/20.0072
utb.fulltext.projects	CZ.1.05/2.1.00/03.0089
utb.fulltext.projects	TACR TE01020197
utb.fulltext.projects	IGA/FAI/2013/012
utb.fulltext.faculty	Faculty of Applied Informatics
utb.fulltext.ou	-