Dominant Takeover Regimes for Genetic Algorithms
The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws [1–2]. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler’s device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solutions reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.
KeywordsGenetic Algorithm Convergence Time Partial Summation Approximate Limit Genetic Algorithm Processing
Unable to display preview. Download preview PDF.
- 1.Holland, J.H.: Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: University of Michigan Press 1975.Google Scholar
- 2.Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Massachusetts: Addison Wesley 1989.Google Scholar
- 4.Ankenbrandt, C.: (1991) “Time Complexity and Convergence of Genetic Algorithms”.Rawlins, G.J.E. (ed.): Foundations of Genetic Algorithms. San Mateo, California: Morgan Kaufmann Publishers 1991.Google Scholar
- 5.Noever D. and Baskaran, S.: “Steady State vs. Generational Genetic Algorithms: A Comparison of Time Complexity and Convergence Properties” Santa Fe Institute preprint series, 92-07-032 (submitted to Machine Learning) (1992).Google Scholar
- 6.Goldberg, D.E. and Deb, K.: “A Comparative Analysis of Selection Schemes Used in Genetic Algorithms,” Rawlins, G.J.E. (ed.): Foundations of Genetic Algorithms. San Mateo, California: Morgan Kaufmann Publishers 1991.Google Scholar