Publikace UTB
Repozitář publikační činnosti UTB
Graph based evolutionary algorithms: Producing spanning tree individuals
Repozitář DSpace/Manakin
Kontaktujte nás | Jazyk: čeština English
- Domovská stránka DSpace
- →
- Článek ve sborníku
- →
- Fakulta aplikované informatiky
- →
- Zobrazit záznam
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.title | Graph based evolutionary algorithms: Producing spanning tree individuals | en |
| dc.contributor.author | Košťálová, Alena | |
| dc.contributor.author | Král, Erik | |
| dc.contributor.author | Prokopová, Zdenka | |
| dc.contributor.author | Loureiro Da Costa, Augusto | |
| dc.relation.ispartof | Proceedings - 2018 International Conference on Computational Science and Computational Intelligence, CSCI 2018 | |
| dc.identifier.isbn | 978-1-72811-360-9 | |
| dc.date.issued | 2018 | |
| dc.citation.spage | 1440 | |
| dc.citation.epage | 1441 | |
| dc.event.title | 2018 International Conference on Computational Science and Computational Intelligence, CSCI 2018 | |
| dc.event.location | Las Vegas, NV | |
| utb.event.state-en | United States | |
| utb.event.state-cs | Spojené státy americké | |
| dc.event.sdate | 2018-12-13 | |
| dc.event.edate | 2018-12-15 | |
| dc.type | conferenceObject | |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
| dc.identifier.doi | 10.1109/CSCI46756.2018.00280 | |
| dc.relation.uri | https://ieeexplore.ieee.org/document/8947899 | |
| dc.subject | crossing | en |
| dc.subject | evolutionary algorithms | en |
| dc.subject | genetic algorithms | en |
| dc.subject | mutation | en |
| dc.subject | spanning tree | en |
| dc.description.abstract | This poster 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. © 2018 IEEE. | en |
| utb.faculty | Faculty of Applied Informatics | |
| dc.identifier.uri | http://hdl.handle.net/10563/1009551 | |
| utb.identifier.obdid | 43878785 | |
| utb.identifier.scopus | 2-s2.0-85078570838 | |
| utb.source | d-scopus | |
| dc.date.accessioned | 2020-02-11T10:07:38Z | |
| dc.date.available | 2020-02-11T10:07:38Z | |
| utb.ou | CEBIA-Tech | |
| utb.contributor.internalauthor | Košťálová, Alena | |
| utb.contributor.internalauthor | Král, Erik | |
| utb.contributor.internalauthor | Prokopová, Zdenka | |
| utb.fulltext.affiliation | Alena Košťálová, Erik Král, Zdenka Prokopová, Augusto Loureiro da Costa Faculty of Applied Informatics Tomas Bata University in Zlin Zlín, Czech Republic E-mail: kostalova@utb.cz LaR - Robotics Lab. Federal University of Bahia Salvador, Brazil | |
| utb.fulltext.dates | - | |
| utb.fulltext.sponsorship | This research was supported by the Internal Grant Agency of Tomas Bata University in Zlin under the project IGA/CebiaTech/2018/004. | |
| utb.scopus.affiliation | Faculty of Applied Informatics Tomas Bata, University in Zlin, Zlin, Czech Republic; LaR - Robotics Lab. Federal, University of BahiaSS, Salvador, Brazil | |
| utb.fulltext.projects | IGA/CebiaTech/2018/004 | |
| utb.fulltext.faculty | Faculty of Applied Informatics | |
| utb.fulltext.faculty | Faculty of Applied Informatics | |
| utb.fulltext.faculty | Faculty of Applied Informatics |
