On the self-organizing migrating algorithm comparison by means of centrality measures

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10244249" target="_blank" >RIV/61989100:27240/20:10244249 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-030-14907-9_33" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-14907-9_33</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-14907-9_33" target="_blank" >10.1007/978-3-030-14907-9_33</a>

Result language
angličtina
Original language name
On the self-organizing migrating algorithm comparison by means of centrality measures
Original language description
In this article we continue in our research which combines three different areas - swarm and evolutionary algorithms, networks and coupled map lattices control. Main aim of this article is to compare networks obtained from best and worst self-organizing migrating algorithm runs. All experiments were done on well known CEC 2014 benchmark functions. For each selected function we picked 30 best and 30 worst runs, converted each run into a network, counted selected properties and compared the results. All obtained results are reported in this article. (C) Springer Nature Switzerland AG 2020.
Czech name
—
Czech description
—

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)