Optimum Population Size and Mutation Rate for a Simple Real Genetic Algorithm that Optimizes Array Factors

摘要

The population size and mutation rate of a genetic algorithm have great influence upon the speed of convergence. Most genetic algorithm enthusiants use a large population size and low mutation rate due to the recommendations of several early studies. These studies were somewhat limited. This paper presents results that show a small population size and high mutation rate are actually better for many problems.