Table 1: Genetic algorithm operations.

(A) Generate randomly an initial population of individuals.
(B) Carry out the following substeps iteratively for each generation until a termination condition is fulfilled.
(i) Evaluate fitness of each individual to check its ability to solve the specific problem and save the best individual of all preceding population.
(ii) Select pair of individuals to be parents for reproduction on the basis of their fitness.
(iii) Generate offsprings from parents by implementing genetic search operators such as cross-over/mutation. Add them to the population.