Design of evolutionary algorithms-A statistical perspective

作者: O. Francois , C. Lavergne

DOI: 10.1109/4235.918434

关键词:

摘要: This paper describes a statistical method that helps to find good parameter settings for evolutionary algorithms. The builds functional relationship between the algorithm's performance and its values. relationship-a model-can be identified thanks simulation data. Estimation test procedures are used evaluate effect of variation. In addition, can investigated with reduced number experiments. Problem labeling also considered as model variable enables identifying classes problems which algorithm behaves similarly. Defining such increases quality estimations without increasing computational cost.

参考文章(38)
Lawrence Davis, Bit-Climbing, Representational Bias, and Test Suite Design. ICGA. pp. 18- 23 ,(1991)
P. J. Cheek, P. McCullagh, J. A. Nelder, Generalized Linear Models, 2nd Edn. Applied Statistics. ,vol. 39, pp. 385- 386 ,(1990) , 10.2307/2347392
L. Darrell Whitley, Keith E. Mathias, John Dzubera, Soraya B. Rana, Building Better Test Functions international conference on genetic algorithms. pp. 239- 247 ,(1995)
Kihong Park, A Comparative Study of Genetic Search international conference on genetic algorithms. pp. 512- 519 ,(1995)
Colin Reeves, Christine Wright, An Experimental Design Perspective on Genetic Algorithms Foundations of Genetic Algorithms. ,vol. 3, pp. 7- 22 ,(1995) , 10.1016/B978-1-55860-356-1.50005-4
Yuval Davidor, Epistasis Variance: A Viewpoint on GA-Hardness Foundations of Genetic Algorithms. ,vol. 1, pp. 23- 35 ,(1991) , 10.1016/B978-0-08-050684-5.50005-7
Colin R. Reeves, Christine C. Wright, Epistasis in Genetic Algorithms: An Experimental Design Perspective international conference on genetic algorithms. pp. 217- 224 ,(1995)
Stephanie Forrest, Terry Jones, Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms international conference on genetic algorithms. pp. 184- 192 ,(1995)