On the analysis of the (1+1) Evolutionary Algorithm with short-term memory

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 235-241

  Sung, Chi Wan ^a   Yuen, Shiu Yin ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; LEARNING ALGORITHMS;

RANDOMIZED LOCAL SEARCHES; RANDOMIZED SEARCHES; RUNNING TIMES; SEARCH POINTS;

EVOLUTIONARY ALGORITHMS;

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

References (20)

1. J. H. Holland, Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.
2. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
3. B. Hajek, "Cooling schedules for optimal annealing," Mathematics of Operations Research, vol. 13, no. 2, pp. 311-329, 1988.
4. G. Rudolph, Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovac, 1997.
5. H. Mühlenbein, "How genetic algorithms really work: mutation and hillclimbing," Proc. PPSN, pp. 15-26, 1992.
6. J. Garnier, L. Kallel, and M. Schoenauer, "Rigorous hitting times for binary mutations," Evolutionary Computation, vol. 7, no. 1, pp. 167-203, 1999.
7. G. Rudolph, "How mutation and selection solve long path problems in polynomial expected time," Evolutionary Computation, 1996.
8. J. Garnier and L. Kallel, "Statistical distribution of the convergence time of evolutionary algorithms for long path problems," IEEE Trans. Evolutionary Computation, vol. 4, no. 1, pp. 16-30, 2000.
9. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) evolutionary algorithm," Theoretical Computer Science, vol. 276, pp. 51-81, 2002.
10. J. He and X. Yao, "Towards an analytic framework for analysing the computation time of evolutionary algorithms," Artificial Intelligence, vol. 145, pp. 59-97, 2003.
11. T. Jansen, K. A. D. Jong, and I. Wegener, "On the choice of the offspring population size in evolutionary algorithms," Evolutionary Computation, vol. 13, no. 4, pp. 413-440, 2005.
12. J. He and X. Yao, "From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evolutionary Computation, vol. 6, no. 5, pp. 495-511, 2002.
13. C. Witt, "Runtime analysis of the (μ+1) EA on simple pseudo-boolean functions," Evolutionary Computation, vol. 14, no. 1, pp. 65-86, 2006.
14. M. Dietzfelbinger, B. Naudts, C. V. Hoyweghen, and I. Wegener, "The analysis of a recombinative hill-climber on h-iff," IEEE Trans. Evolutionary Computation, vol. 7, no. 5, pp. 417-423, Oct. 2003.
15. T. Jansen and I. Wegener, "The analysis of evolutionary algorithms - a proof that crossover really can help," Algorithmica, vol. 34, no. 1, pp. 47-66, 2002.
16. D. Sudholt, "Crossover is provably essential for the ising model on trees," Proc. GECCO, pp. 1161-1167, 2005.
17. T. Jansen and I. Wegener, "On the local performance of simulated annealing and the (1+1) evolutionary algorithm," Proc. GECCO, pp. 469-475, 2006.
18. D. Sudholt "On the analysis of the (1+1) memetic algorithm," Proc. GECCO, pp. 493-500, 2006.
19. S. Y. Yuen and C. K. Chow, "A non-revisiting genetic algorithm," Proc. CEC, Sep. 2007.
20. F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.