A Novel Strategy to Control Population Diversity and Convergence for Genetic Algorithm

摘要

Genetic algorithm (GA), an efficient evolutionary algorithm inspired from the science of genetics, attracts the worldwide attention for several decades. This paper tries to strengthen the search ability of the population in GA in the way of improving the distance among individuals by introducing a new solution updating strategy based on the theory of Cooperative Game. The simulation is done using fourteen benchmark functions, and the results demonstrate that this modified genetic algorithm works efficiently.