. "Davendra, Donald" . "Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem"@en . . . "8370" . . . "RIV/70883521:28140/14:43872695" . "\u0160enke\u0159\u00EDk, Roman" . "Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem"@en . "RIV/70883521:28140/14:43872695!RIV15-MSM-28140___" . "Proceedings of the Fifth International Cnference on Innovations in Bio-Inspired Computing and Applications" . . . "978-3-319-08155-7" . . "10.1007/978-3-319-08156-4_15" . "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." . "Ostrava" . "Combinatorial optimization, Evolutionary Algorithms, Complex networks"@en . "Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem" . . "10"^^ . "4"^^ . "[FFEF67381C58]" . "2014-06-23+02:00"^^ . . . "Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem" . . "2"^^ . "P(ED2.1.00/03.0089), P(EE.2.3.20.0072), P(EE.2.3.20.0073), P(GA13-08195S), S" . . . "Zelinka, Ivan" . . . . . "Pluh\u00E1\u010Dek, Michal" . "Heidelberg" . . "2194-5357" . "Springer-Verlag. Berlin" . . . "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."@en . "28140" .