A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem
暂无分享,去创建一个
[1] Hans-Paul Schwefel,et al. How to analyse evolutionary algorithms , 2002, Theor. Comput. Sci..
[2] Rajeev Motwani,et al. Lecture notes on approximation algorithms: Volume I , 1993 .
[3] L. D. Whitley,et al. The No Free Lunch and problem description length , 2001 .
[4] Isaac K. Evans,et al. Evolutionary Algorithms for Vertex Cover , 1998, Evolutionary Programming.
[5] Xin Yao,et al. Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..
[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[7] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[8] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[9] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .
[10] Xin Yao,et al. Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85] , 2002, Artif. Intell..