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

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Tomaszek, L., Lycka, P., & Zelinka, I. (2020). On the self-organizing migrating algorithm comparison by means of centrality measures. In Lecture Notes in Electrical Engineering (Vol. 554, pp. 335–343). Springer Verlag. https://doi.org/10.1007/978-3-030-14907-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free