A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 35, Issue 2, 2005, Pages 266-271

  He, Jun ^a   Yao, Xin ^a   Li, Jin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Algorithm design; Heuristic knowledge; Optimization methods; Performance analysis

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; KNOWLEDGE ENGINEERING; OPTIMIZATION; PROBLEM SOLVING;

ALGORITHM DESIGN; HEURISTIC KNOWLEDGE; NODE COVERING PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 18544379627     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2004.841903     Document Type: Article

References (12)

1. T. M. English, "Evaluation of evolutionary and genetic optimizer: No free lunch," in Proc. 5th Annu. Conf. Evolutionary Programming, L. J. Fogel, P. J. Angeline, and T. Bäck, Eds. Cambridge, MA, 1996, pp. 163-169.
2. D. H. Wolpert and W. G. Macready, "No free lunch theorem for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
3. S. Droste, T. Jansen, and I. Wegener, "Perhaps not a free lunch but at least a free appetizer," in Proc. Genetic Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds. San Mateo, CA, 1999, pp. 833-839.
4. C. C. Schumacher, M. D. Vose, and L. D. Whitley, "The no free lunch and problem description length," in Proc. Genetic Evolutionary Computation Conf., L. Spector, E. D. Goodman, A. Wu, W. Langdon, H.-M Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, Eds. San Mateo, CA, 2001, pp. 565-570.
5. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. New York: Dover, 1998.
6. R. Motwani, "Lecture Notes on Approximation Algorithms: Volume I," Dept. Comput. Sci., Stanford Univ., Stanford, CA, Tech. Rep. CS-TR-92-1435, 1992.
7. S. Khuri and T. Bäck, "An evolutionary heuristic for the minimum vertex cover problem," in Proc. Workshop 18th Annu. German Conf. Artificial Intelligence, J. Hopf, Ed., Saarbrücken, Germany, 1994, pp. 86-90.
8. I. K. Evans, "Evolutionary algorithms for vertex cover," in Proc. 7th Annu. Conf. Evolutionary Programming, V. W. Porto, N. Saravanan, D. E. Waagen, and A. E, Eiben, Eds, New York, 1998, pp. 377-386.
9. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 127, no. 1, pp. 57-85, 2001.
10. J. He and X. Yao, "Toward an analytic framework for analysing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, no. 1-2, pp. 59-97, 2003.
11. H.-G. Beyer, H.-E Schwefel, and I. Wegener, "How to analyze evolutionary algorithms," Theor. Comput. Sci., vol. 287, no. 1, pp. 101-130, 2002.
12. J. He and X. Yao, "Erratum to: Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 140, no. 1-2, pp. 57-85, 2001.