An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 2004-2010

  He, Jun ^a   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION SOLUTION; FEASIBLE SOLUTION; HARD PROBLEMS; OPTIMAL SOLUTIONS; OPTIMISATION PROBLEMS; POLYNOMIAL-TIME; RUNNING TIME;

EVOLUTIONARY ALGORITHMS;

EID: 4344699835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299919     Document Type: Conference Paper

References (12)

1. X. Yao, ed.,Evolutionary Computation: Theory Arid Applications. Singapore: World Scientific Publishing, 1999.
2. R. Sarker, M. Mohammadian, and X. Yao, eds., Evolutionary Optimization, vol. 48 of International Series in Operations Research and Mariagement Science. Boston: Kluwer Academic, 2002.
3. C. H. Papadimitriou and K. Steiglitz, Conibinatorial Oprimiiation: Algorirhnis and Complexity. Mineola, NY Dover, 1998.
4. D. S. Hochbaum, ed., Appmxiniarion Algorirhnis for NP-hard Problenis. Boston, MA: PWS Publishing Company, 1997.
5. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms, " Artificial Intelligence, vol. 127, no. 1, pp. 57-85.2001. .
6. J. He and X. Yao, "Erratum to: Drift analysis and average time complexity of evolutionary algorithms - [artificial intelligence 127 (2001) 57-8S], "Artificial Intelligence, vol. 140, no. 1, pp. 245-248, 2002.
7. J. He and X. Yao, "Towards an analytic framework for analysing the computation time of evolutionary algorithms, " Artificial Intelligence, vol. 145, no. 1-2, pp. 59-97, 2003.
8. G. Rudolph, "Convergence of non-elitist strategies." in Proc. of the First IEEE conference on Evolutionary Computation, vol. I, (Piscataway, NJ), pp. 63-66, IEEE Press, 1994.
9. Y. S. Chow and H. Teicher, Probabilih Theoiy: Independence, Interchangeability and Martingales. New York: Sprnger-Verlag, second ed. 1988.
10. B. Naudts and L. Kallel, "A comparison of predictive measure of problem difficulty in evolutionary algorithms, " IEEE Trans. on Evolutionary Compuration, vol. 4, no. 1, pp. 1-15, 2000.
11. R. Syski, Passage Enresfor Markov Chains. Amsterdam: 10s Press, 1992.
12. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1 + 1) evolutionary algorithms, " Theoretical Computer Science, vol. 276, no. 1-2, pp. 51-81, 2002.