*3.5.2 Genetic algorithms (GA)*

A genetic algorithm with greedy eugenics that takes into account a probability of kill value for each weapon is suggested [14], and compared to MMR algorithm. Although MMR algorithm runs much faster than GA, GA tends to find better solutions than MMR algorithm. And, GA efficiency increases as the number of targets and weapons increases. Also in GA if a set of weapons can also hit a group of targets, meaning that grouping of weapons and targets is possible, this leads to faster and more optimal solutions [15]. Since the algorithm uses randomization it is a nondeterministic algorithm. The genetic algorithm is given as follows [16]:
