Contact Us | Language: čeština English
Title: | Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem |
Author: | Davendra, Donald David; Zelinka, Ivan; Šenkeřík, Roman; Pluháček, Michal |
Document type: | Conference paper (English) |
Source document: | Advances in Intelligent Systems and Computing. 2014, vol. 303, p. 141-150 |
ISSN: | 2194-5357 (Sherpa/RoMEO, JCR) |
ISBN: | 9783319081557 |
DOI: | https://doi.org/10.1007/978-3-319-08156-4_15 |
Abstract: | This research analyses the development of a complex network in an evolutionary algorithm (EA). The main aim is to evaluate if a complex network is generated in an EA, and how the population can be evaluated when the objective is to optimise an NP-hard combinatorial optimisation problem. The population is evaluated as a complex network over a number of generations, and different attributes such as adjacency graph, minimal cut, degree centrality, closeness centrality, betweenness centrality, k-Clique, k-Club, k-Clan and community graph plots are analysed. From the results, it can be concluded that an EA population does behave like a complex network, and therefore can be analysed as such, in order to obtain information about population development. © Springer International Publishing Switzerland 2014. |
Full text: | https://link.springer.com/chapter/10.1007/978-3-319-08156-4_15 |
Show full item record |