2.-What is a genetic algorithm (GA)?

• Genetic algorithms are randomized

search algorithms that have been
developed in an effort to imitate
the mechanics of natural selection
and natural genetics. Genetic
algorithms operate on string
structures, like biological structures,
which are evolving in time
according to the rule of survival of
the fittest by using a randomized
yet structured information
exchange. Thus, in every
generation, a new set of strings is
created, using parts of the fittest
members of the old set. [1]
The main characteristics of a genetic algorithm are as follows:

1) The genetic algorithm works with a coding of the parameter set, not the
parameters themselves.
2) The genetic algorithm initiates its search from a population of points, not a single
point.
3) The genetic algorithm uses payoff information, not derivatives.
4) The genetic algorithm uses probabilistic transition rules, not deterministic ones.
Refers
• [1] Genetic Algorithm - an overview | ScienceDirect Topics. Sciencedirect.com. (2020). Retrieved 11
November 2020, from https://www.sciencedirect.com/topics/engineering/genetic-algorithm.
• [2] Funcionamiento de un algoritmo genético. (2020). [Image]. Retrieved 11 November 2020, from
http://teknolosys.com/2011/04/disenar-carros-con-boxcar-2d/.