A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation

Theoretical Computer Science

Volumn 386, Issue 1-2, 2007, Pages 73-93

  Jansen, Thomas ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Evolutionary algorithms; Landscape analysis; Run time analysis

Indexed keywords

BOOLEAN ALGEBRA; EVOLUTIONARY ALGORITHMS; HEURISTIC PROGRAMMING; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

GLOBAL SEARCH OPERATORS; NONELITIST SELECTION; PSEUDO BOOLEAN FUNCTIONS; RIGOROUS THEORETICAL ANALYSIS;

SIMULATED ANNEALING;

EID: 34848875730     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.06.003     Document Type: Article

References (24)

1. Bäck T. Evolutionary Algorithms in Theory and Practice (1996), Oxford University Press
2. T. Carson, R. Impagliazzo, Hill-climbing finds random planted bisections, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, 2001, pp. 903-909
3. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms (2001), MIT Press
4. Droste S., Jansen T., and Wegener I. Dynamic parameter control in simple evolutionary algorithms. In: Martin W.N., and Spears W.M. (Eds). Foundations of Genetic Algorithms 6. FOGA 2000 (2001), Morgan Kaufmann 275-294
5. Droste S., Jansen T., and Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
6. Feller W. An Introduction to Probability Theory and its Applications I (1968), Wiley
7. Garnier J., Kallel L., and Schoenauer M. Rigorous hitting times for binary mutations. Evolutionary Computation 7 2 (1999) 173-203
8. W.E. Hart, A theoretical comparison of evolutionary algorithms and simulated annealing, in: Proceedings of the Fifth Annual Conference on Evolutionary Programming, 1995, pp. 147-154
9. Ingber L., and Rosen B. Genetic algorithms and very fast reannealing: A comparison. Mathematical and Computer Modeling 16 (1992) 87-100
10. Jansen T., and Wegener I. On the choice of the mutation probability for the (1+1) EA. In: Schoenauer M., Deb K., Rudolph G., Yao X., Lutton E., Merelo J.J., and Schwefel H.-P. (Eds). Sixth International Conference on Parallel Problem Solving From Nature. PPSN VI. LNCS vol. 1917 (2000), Springer 89-98
11. Jansen T., and Wegener I. On the analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34 1 (2002) 47-66
12. Jansen T., and Wegener I. 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 (2002) 589-599
13. Jansen T., and Wegener I. On the analysis of a dynamic evolutionary algorithm. Journal of Discrete Algorithms 4 1 (2006) 181-199
14. Jansen T., and Wegener I. On the local performance of simulated annealing and the (1+1) evolutionary algorithm. In: Keijzer M. (Ed). Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2006 (2006), ACM Press 469-475
15. Jerrum M.R., and Sorkin G. Simulated annealing for graph bisection. Proceedings of the IEEE Symposium on Foundations of Computer Science. FOCS '93 (1993), IEEE Press 94-103
16. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
17. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., and Teller E. Equation of state calculation by fast computing machines. Journal of Chemical Physics 21 (1953) 1078-1092
18. Mühlenbein H. How genetic algorithms really work. Mutation and Hillclimbing. In: Männer R., and Manderick B. (Eds). Proceedings of the 2nd Parallel Problem Solving from Nature. PPSN II (1992), North-Holland 15-25
19. Prügel-Bennett A. When a genetic algorithm outperforms hill-climbing. Theoretical Computer Science 320 1 (2004) 135-153
20. Rudolph G. Convergence Properties of Evolutionary Algorithms (1997), Dr. Kovač
21. Sorkin G.B. Efficient simulated annealing on fractal energy landscapes. Algorithmica 6 (1991) 346-418
22. N.L.J. Ulder, E.H.L. Aarts, H.-J. Bandelt, P.J.M. van Laarhoven, E. Pesch, Genetic local search algorithms for the traveling salesman problem, in: First International Conference on Parallel Problem Solving from Nature, PPSN I, 1994, pp. 109-116
23. Wegener I. Simulated annealing beats Metropolis in combinatorial optimization. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. ICALP 2005. LNCS vol. 3580 (2005), Springer 589-601
24. Wegener I., and Witt C. On the optimization of monotone polynomials by randomized search heuristics. Combinatorics, Probability and Computing 14 (2005) 225-247