A hybrid simulated annealing and threshold accepting for for satisfiability problems using dynamically cooling schemes

Authors:
Felix Martinez-Rios;Juan Frausto-Solis
Affiliations:
Universidad Panamericana, Distrito Federal, México;Tecnológico de Monterrey, Morelos, México
Venue:
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Year:
2007

Citing 5
Cited 0

Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Hard Instance Generation for SAT (Extended Abstract)

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness

CSL '92 Selected Papers from the Workshop on Computer Science Logic
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Adaptive and scalable allocation of data-objects in the web

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI

Quantified Score

Hi-index	0.00

Visualization

Abstract

For Satisfiability (SAT) Problem there is not a deterministic algorithm able to solve it in a polynomial time. Simulated Annealing (SA) and similar algorithms like Threshold Accepting (TA) are able to find very good solutions of SAT instances only if their control parameters are correctly tuned. Classical TA usually uses the same Markov chain length for each temperature cycle but they spend a lot of time. In this paper a method based on the neighborhood structure to get the Markov chain length in a dynamical way for each temperature cycle is proposed. Three cooling schemes are also presented in the paper. The experimentation presented in the paper shows that the proposed method is more efficient than the classical one.