A study on the optimal population size of genetic algorithm

The optimal population size of genetic algorithm is studied, based on the defined partial function. The inner relations between the optimal population size and the code length are obtained using the difference equation to solve discrete optimization problems when binary and natural number codes are used in genetic algorithm operations. The results obtained are useful for genetic algorithms in solving practical problems.