Solving SAT problems with TA algorithms using constant and dynamic markov chains length

• Authors: Héctor Sanvicente–Sánchez;Juan Frausto–Solís;Froilán Imperial–Valenzuela
• Venue: AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
• Year: 2005

Since the apparition of Simulated Annealing algorithm (SA) it has shown to be an efficient method to solve combinatorial optimization problems. Due to this, new algorithms based on two looped cycles (temperatures and Markov chain) have emerged, one of them have been called Threshold Accepting (TA). Classical algorithms based on TA usually use the same Markov chain length for each temperature cycle, these methods spend a lot of time at high temperatures where the Markov chain length is supposed to be small. In this paper we propose a method based on the neighborhood structure to get the Markov chain length in a dynamic way for each temperature cycle. We implemented two TA algorithms (classical or TACM and proposed or TADM) for SAT. Experimentation shows that the proposed method is more efficient than the classical one since it obtain the same quality of the final solution with less processing time.