A study on the convergence of genetic algorithms

This paper extends genetic algorithms to achieve fast solutions to difficult problem. To accomplish this, we present empirical results on the terminated condition by bias and the functionized model of mutation rate in genetic algorithms. The terminated condition by bias enable to reducing computation time(CPU time) according to limitted and pre-estimated number of generations. The functionized model of mutation operator reducing computation time and improving solution should be accomplished by applying quite low mutation rate on the continuing generation with remaining 95 percentage of bias.