Simulated annealing, its parameter settings and the longest common subsequence problem

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 803-810

  Weyland, Dennis ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Longest common subsequence problem; Run time analysis; Simulated annealing

Indexed keywords

HEURISTIC ALGORITHMS;

APPROXIMATION FACTOR; INITIAL TEMPERATURES; LONGEST COMMON SUBSEQUENCE PROBLEM; OPTIMIZATION PROBLEMS; PROBABILISTIC SEARCH; RUN-TIME ANALYSIS; SIMULATED ANNEALING ALGORITHMS; THEORETICAL POINTS;

SIMULATED ANNEALING;

EID: 57349189375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389253     Document Type: Conference Paper

References (14)

1. H.-G. Beyer, H.-P. Schwefel, and I. Wegener. How to analyze evolutionary algorithms. Theoretical Computer Science, 287(1): 101-130, 2002.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
3. O. Giel and I. Wegener. Maximum cardinality matchings on trees by randomized local search. In Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pages 539-546, 2006.
4. T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305-308, 1990.
5. B. Hinkemeyer and B. A. Julstrom. A genetic algorithm for the longest common subsequence problem. In Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference (GECCO 2006), pages 609-610, 2006.
6. T. Jansen and D. Weyland. Analysis of evolutionary algorithms for the longest common subsequence problem. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 1, pages 939-946, London, 7-11 July 2007. ACM Press.
7. B. A. Julstrom and B. Hinkemeyer. Starting from scratch: Growing longest common subsequences with evolution. In Proceedings of the 9th International Conference on Parallel Problem Solving From Nature (PPSN IX), pages 930-938, 2006.
8. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
9. H. Mühlenbein. How evolutionary algorithms really work: Mutation and hillclimbing. In Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature (PPSN II), pages 15-26, 1992.
10. F. Neumann. Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers and Operations Research, 2007. To appear.
11. F. Neumann and I. Wegener. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3):305-319, 2006.
12. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3:349-366, 2004.
13. I. Wegener. Simulated annealing beats metropolis in combinatorial optimization. In ICALP, pages 589-601, 2005.
14. K. Weicker. Evolutionäre Algorithmen. Teubner Verlag, 2002.