ANDYMARK: An Analytical Method to Establish Dynamically the Length of the Markov Chain in Simulated Annealing for the Satisfiability Problem
Because the efficiency and efficacy in Simulated Annealing (SA) algorithms is determined by their cooling scheme, several methods to set it have been proposed. In this paper an analytical method (ANDYMARK) to tune the parameters of the cooling scheme in SA for the Satisfiability (SAT) problem is presented. This method is based on a relation between the Markov chain’s length and the cooling scheme. We compared ANDYMARK versus a classical SA algorithm that uses the same constant Markov chain. Experimentation with SAT instances shows that SA using this method obtains similar quality solutions with less effort than the classical one.
KeywordsSatisfiability Simulated Annealing Combinatorial Optimization NP-Hard Problems Optimization Heuristics
Unable to display preview. Download preview PDF.
- 3.Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of State Calculations by Fast Computing Machines. Chem. Phys. 21, 1087–1092 (1953)Google Scholar
- 4.Sanvicente-Sánchez, H., Frausto-Solís, J.: A Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3043, pp. 755–763. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 6.Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: SAT 2000, pp. 283–292. IOS Press, Amsterdam (2000)Google Scholar