Three-Dimensional Genetic Algorithm for the Kirkman's Schoolgirl problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F18%3A39913700" target="_blank" >RIV/00216275:25530/18:39913700 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Three-Dimensional Genetic Algorithm for the Kirkman's Schoolgirl problem
Original language description
This paper focuses on the possibilities of multidimensional genetic algorithms and relevant genetic operators. After the literature overview we used a three-dimensional genetic algorithm to solve a combinatorial task called Kirkman’s Schoolgirl Problem. The first results were not good, but we improved convergence of an algorithm by adding more genetic operators. We also used problem dependent mutation, where we tried to repair the incorrect solution by using the simple heuristic method. Finally, we got a solid number of correct solutions, but we know there is enough room for other improvements.
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
Mendel
ISBN
—
ISSN
1803-3814
e-ISSN
neuvedeno
Number of pages
6
Pages from-to
25-30
Publisher name
Vysoké učení technické v Brně
Place of publication
Brno
Event location
Brno
Event date
Jun 26, 2018
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—