ANDYMARK: an analytical method to establish dynamically the length of the markov chain in simulated annealing for the satisfiability problem

Authors:
Juan Frausto-Solís;Héctor Sanvicente-Sánchez;Froilán Imperial-Valenzuela
Affiliations:
ITESM, Temixco Morelos, México;IMTA, Jiutepec Morelos, México;UVM, Querétaro, México
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 1
Cited 1

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing implementation with shorter Markov chain length to reduce computational burden and its application to the analysis of pulmonary airway architecture

Computers in Biology and Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.