Complex Network Analysis of Discrete Self-organising Migrating Algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F14%3A43871754" target="_blank" >RIV/70883521:28140/14:43871754 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27240/14:86092651
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complex Network Analysis of Discrete Self-organising Migrating Algorithm
Original language description
This research analyses the development of a complex net- work in the swarm based Discrete Self-Organising Migrating Algorithm (DSOMA). The main aim is to evaluate if a complex network is gen- erated in DSOMA, and how the population can be evaluated whenthe objective is to optimise the flow shop scheduling with blocking problem. The population is evaluated as a complex network over a number of migrations, and different attributes such as adjacency graph, minimal cut, degree centrality, closeness centrality, betweenness centrality, Katz centrality, mean neighbour degree, k-Clique, k-Plan, k-Club, k-Clan and community graph plots are analysed. From the results, it can be con- cluded that an DSOMA population does behave like a complex network, and therefore can be analysed as such, in order to obtain information about population development.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Advances in Intelligent Systems and Computing. 289
ISBN
978-3-319-07400-9
ISSN
2194-5357
e-ISSN
—
Number of pages
14
Pages from-to
161-174
Publisher name
Springer-Verlag Berlin
Place of publication
Heidelberg
Event location
Ostrava
Event date
Jun 23, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—