This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://localhost/temp/predkladatel/
n20http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n12https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F70883521%3A28140%2F14%3A43872695%21RIV15-MSM-28140___/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F70883521%3A28140%2F14%3A43872695%21RIV15-MSM-28140___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
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. 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.
dcterms:title
Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
skos:prefLabel
Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
skos:notation
RIV/70883521:28140/14:43872695!RIV15-MSM-28140___
n3:aktivita
n7:S n7:P
n3:aktivity
P(ED2.1.00/03.0089), P(EE.2.3.20.0072), P(EE.2.3.20.0073), P(GA13-08195S), S
n3:dodaniDat
n6:2015
n3:domaciTvurceVysledku
n15:3484432 n15:9388486
n3:druhVysledku
n19:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
8370
n3:idVysledku
RIV/70883521:28140/14:43872695
n3:jazykVysledku
n21:eng
n3:klicovaSlova
Combinatorial optimization, Evolutionary Algorithms, Complex networks
n3:klicoveSlovo
n10:Complex%20networks n10:Evolutionary%20Algorithms n10:Combinatorial%20optimization
n3:kontrolniKodProRIV
[FFEF67381C58]
n3:mistoKonaniAkce
Ostrava
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Proceedings of the Fifth International Cnference on Innovations in Bio-Inspired Computing and Applications
n3:obor
n4:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n18:EE.2.3.20.0072 n18:ED2.1.00%2F03.0089 n18:GA13-08195S n18:EE.2.3.20.0073
n3:rokUplatneniVysledku
n6:2014
n3:tvurceVysledku
Davendra, Donald Šenkeřík, Roman Zelinka, Ivan Pluháček, Michal
n3:typAkce
n17:WRD
n3:zahajeniAkce
2014-06-23+02:00
s:issn
2194-5357
s:numberOfPages
10
n14:doi
10.1007/978-3-319-08156-4_15
n20:hasPublisher
Springer-Verlag. Berlin
n12:isbn
978-3-319-08155-7
n22:organizacniJednotka
28140