In this paper, the state of the theory of genetic algorithms is examined, and the No Free Lunch theorem is introduced. The general framework of genetic algorithms is described, in which the performance analysis matrix is built and used to test some typical genetic algorithms. The experimental results indicate that it is a feasible method, which is easy and adaptable to the evaluation of the performance of genetic algorithms.
[1] Xu, Zong-ben, Li, Guo. Simulated biology algorithms for global optimization, Part (Ⅰ)——simulated evolutionary algorithms. Chinese Journal of Operations Research, 1995,(2):1~13 (in Chinese).徐宗本,李国.解全局优化问题的仿生类算法(Ⅰ)——模拟演化算法. 运筹学杂志,1995,(2):1~13.
[2] Fogel, D.B. An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks, 1994,5(1):3~14.
[3] Asoh, H., Muhlenbein, H. On the mean convergence time of evolutionary alg orithms without selection and mutation. In: Davidor, Y., Schwefel, H., Manner, R ., eds. Parallel Problem Solving from Nature, PPSN III. Berlin: Springer-Verlag , 1994. 88~97.
[4] Goldberg, D.E., Segrest, P. Finite Markov chain analysis of genetic algor ithms. In: Grefenstette, J.J., ed. Proceedings of the 2nd International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates, 1987. 1~8.
[5] Ankenbrandt, C.A. An extension to the theory of convergence and a proof the time complexity of genetic algorithms. In: Rawlins, G.J.E., ed. Foundations of Genetic Algorithms. San Francisco: Morgan Kaufmann Publishers, Inc., 1994. 53~ 58.
[6] Wolpert, D.H., Macready, W.G. No free lunch theorems for search. IEEE Tra nsactions on Evolutionary Computation, 1997,1(1):67~82.
[7] Radcliffe, N.J., Surry, P.D. Fundamental limitations on search algorithms : evolutionary computing in perspective. In: Van Leeuwen, J., ed. Computer Scien ce Today: Recent Trends and Developments. Berlin: Springer-Verlag, 1995. 274~29 1.
[8] David, H.A. Order Statistics. 2 ed, New York: John Wiley and Sons, Inc., 1981. 73~78.