
TIME-CONSUMING FITNESS FUNCTIONS APPROXIMATION FOR GENETIC ALGORITHMS PERFORMANCE IMPROVEMENT
(SGEM WORLD SCIENCE (SWS) Scholarly Society, 2022, Gergana Mateeva, Dimitar Parvanov, Ioan Dimitrov, Iliyan Iliev, Todor Balabanov)
Show more
Genetic algorithms are one of the most efficient meta-heuristics. The base of genetic algorithms is a set of candidate optimal solutions called population. The initial population usually is randomly generated. Optimization goes in epochs of new generations. New generations are produced after crossover and mutation. Mating between individuals is done after the selection of the better-fitted individuals. The fitness value of each individual is calculated by supplying the candidate solution to the optimized target fu...

