The results show that the best
fitness values are with large initial population and large p values. The number
of iterations are fixed, because there is no improvement on fitness values.
In the future works, we could use
the other options on the reproduction algorithm or selecting parents algorithm.
In the porposed algorithmi we deleted the parents after a new generation,
instead of that we could put the parents again in the mating pool and they
could be included for the next generation. Also, we could study on mutation
operator for the reproduction algorithm.
Finally, we could use genetic
algorithm with dealing metaheuristic on combinatorial optimization problems.