Genetic algorithms are unconstrained search methods that were originally designed to optimize a
single criterion as represented by the fitness of each individual in the population. It uses the evolutionary
concept of natural selection to converge on an optimal solution over many generations GAs [7]. It could
solve complicated problems using evolutionary principles to find optimal solutions [8]. Several
comparative studies related to discrete parameters optimization have been discussed in former research:
genetic algorithm, particle swarm, and sequential search methods. The GA method was found to be more
efficient than the sequential search and particle swarm optimization when several parameters are
considered in the optimization. The advantage of GA method is especially valuable when the cost
function becomes more expensive to evaluate. The efficiency of GAs increases as the size of the search
space increases