Comparing strategies for search space boundaries violation in PSO
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F17%3A63517180" target="_blank" >RIV/70883521:28140/17:63517180 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-59060-8_59" target="_blank" >http://dx.doi.org/10.1007/978-3-319-59060-8_59</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-59060-8_59" target="_blank" >10.1007/978-3-319-59060-8_59</a>
Alternative languages
Result language
angličtina
Original language name
Comparing strategies for search space boundaries violation in PSO
Original language description
In this paper, we choose to compare four methods for controlling particle position when it violates the search space boundaries and the impact on the performance of Particle Swarm Optimization algorithm (PSO). The methods are: hard borders, soft borders, random position and spherical universe. The goal is to compare the performance of these methods for the classical version of PSO and popular modification - the Attractive and Repulsive Particle Swarm Optimization (ARPSO). The experiments were carried out according to CEC benchmark rules and statistically evaluated.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-319-59059-2
ISSN
0302-9743
e-ISSN
neuvedeno
Number of pages
9
Pages from-to
655-664
Publisher name
Springer-Verlag Berlin
Place of publication
Heidelberg
Event location
Zakopane
Event date
Jun 11, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—