SOMA Network Model Based on Native Visibility Graph
Lukas Tomaszek, Ivan Zelinka
Mendel · 2017
doi:10.13164/mendel.2017.1.049 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this article, we want to propose a new model of the network for analyzing the evolution algorithms. We focus on the graph called native visibility graph. We show how we can get a time series from the run of the self-organizing migrating algorithm and how we can convert these series into a network. At the end of the article, we focus on some basic network properties and we propose how can we use these properties for later investigation. All experiments run on well-known CEC 2016 benchmarks.
Abstract licence: CC BY-NC-SA
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.