Polytechnic and design, Vol. 9 No. 4, 2021.
Review article
https://doi.org/10.19279/TVZ.PD.2021-9-4-07
BASIC PRINCIPLES OF GENETIC ALGORITHMS
Vedran Mihelj
; Zagreb University of Applied Sciences, Zagreb, Croatia, student
Aleksandar Stojanović
; Zagreb University of Applied Sciences, Zagreb, Croatia
Abstract
Genetic algorithm is a heuristic search method inspired by biological evolution processes. That method has proven successful for many types of problems for which finding a solution requires searching a large potential solution space and for which egzact methods, such as dynamic programming, are not efficient enough. In this paper we describe basic principles of genetic algorithms such as selection, crossover, mutation and fitness function together with some application areas such as optimization, genetic programming and grammatic and semantic inference. Although the basic principles of genetic algorithms are simple, some problems that limit their usability and finding an optimal and/or acceptable solution are complex and/or inneficient fitness function and achieving local optimum which stops them from converging towards a global optimum.
Keywords
genetic operators; evolutionary computing; optimization
Hrčak ID:
275105
URI
Publication date:
1.3.2022.
Visits: 519 *