On the local performance of simulated annealing and the (1+1) evolutionary algorithm

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 469-476

  Jansen, Thomas ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Evolutionary algorithms; Local performance; Mutation; Run time analysis; Selection; Simulated annealing

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; SIMULATED ANNEALING;

LOCAL PERFORMANCES; MUTATION; RUN TIME ANALYSIS; SEARCH SPACE;

EVOLUTIONARY ALGORITHMS;

EID: 33750237514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144084     Document Type: Conference Paper

References (17)

1. T. H. Cormen, G. E. Leiserson, R. L. Rivest, and G. Stein. Introduction to Algorithms. MIT Press, 2002.
2. J. R. Cruz and C. C. Y. Dorea. Simple conditions for thé convergence of simulated annealing type algorithms. Journal of Applied Probability, 35(4):885-892, 1998.
3. S. Droste, T. Jansen, and I. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 2006. To appear. Available online via Springer Online First. http://www.springerlink.com/index/10.1007/s00224004-1177-z.
4. W. Feller. An Introduction to Probability Theory and its Applications I. Wiley, 1968.
5. B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2):311-329, 1988.
6. T. Jansen. On the analysis of dynamic restart strategies for evolutionary algorithms. In J. Merelo-Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors, Proceedings of the 7th International Conference on Parallel Problem Solving From Nature (PPSN VII), pages 33-43. Springer, 2002. LNCS 2439.
7. T. Jansen. A comparison of simulated annealing with a simple evolutionary algorithm. In A. H. Wright, M. D. Vose, and K. A. De Jong, editors, Foundation of Genetic Algorithms 8 (FOGA 2005), pages 37-57. Springer, 2005. LNCS 3469.
8. T. Jansen and I. Wegener. On the choice of the mutation probability for the (1+1) EA. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo-Guervos, and H.-P. Schwefel, editors, Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN VI), pages 89-98. Springer, 2000. LNCS 1917.
9. T. Jansen and I. Wegener. Evolutionary algorithms -how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6):589-599, 2002.
10. T. Jansen and I. Wegener. On the analysis of a dynamic evolutionary algorithm. Journal of Discrete Algorithms, 2006. To appear. Available online via Science Direct. http://dx.doi.0rg/10.1016/j.jda.2005.01.002.
11. M. Jerrum and G. Sorkin. Simulated annealing for graph bisection. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS 1993), pages 94-103. IEEE Press, 1993.
12. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
13. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
14. R. Motwani and P. Rhagavan. Randomized Algorithms. Cambridge University Press, 1995.
15. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, 1997.
16. I. Wegener. Simulated annealing beats metropolis in combinatorial optimization. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), pages 589-601. Springer, 2005. LNCS 3580.
17. I. Wegener and C. Witt. On the optimization of monotone polynomials by randomized search heuristics. Combinatorics, Probability and Computing, 14:225-247, 2005.