Paper Info
Title
Simulated annealing, its parameter settings and the longest common subsequence problem
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.
Year
DOI
Venue
2008
10.1145/1389095.1389253
GECCO
Keywords
Field
DocType
parameter setting,approximation factor,appropriate parameter value,longest common subsequence problem,optimization problem,simulated annealing,cooldown factor,optimization process,different value,simulated annealing algorithm,timing analysis,longest common subsequence
Simulated annealing,Mathematical optimization,Heuristic,Longest common subsequence problem,Computer science,Algorithm,Adaptive simulated annealing,Probabilistic logic,Optimization problem
Conference
Citations 
PageRank 
References 
7
0.45
10
Authors
1
Name
Order
Citations
PageRank
Dennis Weyland11088.43