Dennis Weyland
ABSTRACT
Simulated Annealing is a probabilistic search heuristic for solving optimization problems and is used with great success on real life problems. In its standard form Simulated Annealing has two parameters, namely the initial temperature and the cooldown factor. In literature there are only rules of the thumb for choosing appropriate parameter values. This paper investigates the influence of different values for these two parameters on the optimization process from a theoretical point of view and presents some criteria for problem specific adjusting of these parameters.
With these results the performance of the Simulated Annealing algorithm on solving the Longest Common Subsequence Problem is analysed using different values for the two parameters mentioned above. For all these parameter settings it is proved that even rather simple input instances of the Longest Common Subsequence Problem can neither be solved to optimality nor approximately up to an approximation factor arbitrarily close to 2 efficiently.
- H.-G. Beyer, H.-P. Schwefel, and I. Wegener. How to analyze evolutionary algorithms. Theoretical Computer Science, 287(1):101--130, 2002. Google Scholar
Digital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001. Google ScholarDigital Library
- 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 Google ScholarDigital Library
- T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305--308, 1990. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- 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.Google Scholar
- F. Neumann. Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers and Operations Research, 2007. To appear. Google ScholarDigital Library
- F. Neumann and I. Wegener. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3):305--319, 2006. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- I. Wegener. Simulated annealing beats metropolis in combinatorial optimization. In ICALP, pages 589--601, 2005. Google ScholarDigital Library
- K. Weicker. Evolutionäre Algorithmen. Teubner Verlag, 2002.Google Scholar
Index Terms
- Simulated annealing, its parameter settings and the longest common subsequence problem
Recommendations
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is one of the well-known combinatorial optimization problems and is known for its various applications. In this paper, we propose a modified simulated annealing algorithm for the QAP - M-SA-QAP. The novelty of the ...
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem
Artificial EvolutionAbstractIn this paper we propose a Beam-ACO approach for a combinatorial optimization problem known as the repetition-free longest common subsequence problem. Given two input sequences and over a finite alphabet , this problem concerns to find a longest ...
Solving the truck and trailer routing problem based on a simulated annealing heuristic
In this study, we consider the application of a simulated annealing (SA) heuristic to the truck and trailer routing problem (TTRP), a variant of the vehicle routing problem (VRP). In the TTRP, some customers can be serviced by either a complete vehicle (...
Comments