On the Leader Selection in the Self-Organizing Migrating Algorithm

Simple item page
dc.contributor.authorTomaszek, Lukas
dc.contributor.authorZelinka, Ivan
dc.contributor.authorChadli, Mohammed
dc.coverage.issue1cs
dc.coverage.volume25cs
dc.date.accessioned2020-05-05T07:21:10Z
dc.date.available2020-05-05T07:21:10Z
dc.date.issued2019-06-24cs
dc.description.abstractIn this article, a novel leader selection strategy for the self-organizing migrating algorithm is introduced. This strategy replaces original AllToOne and AllToRand strategies. It is shown and statistically tested, that the new strategy outperforms the original ones. All the experiments were conducted on well known CEC 2014 benchmark functions according to the CEC competition rules and reported here.en
dc.formattextcs
dc.format.extent171-178cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationMendel. 2018 vol. 25, č. 1, s. 171-178. ISSN 1803-3814cs
dc.identifier.doi10.13164/mendel.2019.1.171en
dc.identifier.issn2571-3701
dc.identifier.issn1803-3814
dc.identifier.urihttp://hdl.handle.net/11012/186995
dc.language.isoencs
dc.publisherInstitute of Automation and Computer Science, Brno University of Technologycs
dc.relation.ispartofMendelcs
dc.relation.urihttps://mendel-journal.org/index.php/mendel/article/view/95cs
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International licenseen
dc.rights.accessopenAccessen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0en
dc.subjectself-organizing migrating algorithmen
dc.subjectCEC 2014 benchmarken
dc.subjectAllToNBest strategyen
dc.subjectswarm algorithmsen
dc.titleOn the Leader Selection in the Self-Organizing Migrating Algorithmen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2019-1-171.pdf
Size:
943.58 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Vol. 25, No. 1