Small populations in GPA-ES algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F13%3A00213000" target="_blank" >RIV/68407700:21260/13:00213000 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Small populations in GPA-ES algorithm
Original language description
This paper is devoted to a discussion of the phenomenon of extremely small populations in both parts of GPA-ES algorithm, it means in both Genetic Programming Algorithm and Evolutionary Strategy. Small populations decrease time consumption of some algorithm components like population sorting but on the opposite side they bring risks of needed population number increase and also the increase of the results variance. The paper discusses results of the first experiments with symbolic regression of Lorenz Attractor Equations. For this purpose, the alternative measure of the algorithm efficiency based on the number of fitness function evaluations is applied on the place of the number of evolution cycles, which was used in the previous works about the GPA-ESalgorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2013
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 2013
ISBN
978-80-214-4755-4
ISSN
1803-3814
e-ISSN
—
Number of pages
6
Pages from-to
31-36
Publisher name
Brno University of Technology, Faculty of Mechanical Engineering
Place of publication
Brno
Event location
Brno
Event date
Jun 26, 2013
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—