Graph Based Evolutionary Algorithms: Producing Spanning Tree Individuals
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F18%3A63520182" target="_blank" >RIV/70883521:28140/18:63520182 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Based Evolutionary Algorithms: Producing Spanning Tree Individuals
Original language description
This paper addresses drawbacks of the use of evolutionary algorithms to solve problems that are represented in a form of a graph with a spanning tree solution. The spanning trees are notoriously hard to cross and mutate. Commonly requiring special checking and correcting algorithms to be used. We propose a new structure which overcomes the problem by the means of a bijective mapping into another graph domain.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
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
Proceedings - 2018 International Conference on Computational Science and Computational Intelligence, CSCI 2018
ISBN
978-1-72811-360-9
ISSN
—
e-ISSN
neuvedeno
Number of pages
2
Pages from-to
"nestrankovano"
Publisher name
IEEE Computer Society Conference Publishing Services (CPS)
Place of publication
Washington, DC
Event location
Las Vegas
Event date
Dec 13, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—