The performance of genetic algorithms in dynamic optimization problems

In dynamic optimization problems, both the falls and the attraction basins of local optima are time-varying. By the infinite population model and the further experiments, the influence of the dynamic environment on the performance of genetic algorithms is analyzed. The results show that genetic algorithms should keep dynamic balance between the exploitation capacity and the exploration capacity so as to keep excellent performance in the dynamic optimization problems.