Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Crescenzi, P., Kann, V.: How to find the best approximation results a follow–up to garey and johnson. ACM SIGACT, News, 9097 (1998)
Sanvicente-Sánchez, H.: Metodología de paralelización del ciclo de temperaturas en algoritmos tipo recocido simulado. PhD thesis, ITESM Campus Cuernavaca, MÉXICO (2003)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 4598, 671–680 (1983), 220, 4598
Cerny, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45, 41–51 (1985)
Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 161–175 (1990)
Sanvicente-Sánchez, H., Frausto-Solís, J.: Method to Establish the Cooling Scheme in Simulated Anneling Like Algorithms. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.K., Gervasi, O. (eds.) Computational Science and its Applications–ICCSA 2004. LNCS. Springer, Heidelberg (2004)
Munakata, T., Nakamura, Y.: Temperature control for simulated annealing. The American Physical Society, Physical Review E 64 (2001)
Atiqullah, M.M.: An efficient simple cooling scheme for simulated annealing. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 396–404. Springer, Heidelberg (2004)
Miki, M., Hiroyasu, T., Ono, K.: Simulated annealing with advanced adaptive neighborhood. In: Second international workshop on Intelligent systems design and application, pp. 113–118. Dynamic Publishers, Inc. (2002)
Miki, M., Hiroyasu, T., Kasai, M., Ono, K., Jitta, T.: Temperature parallel simulated annealing with adaptive neighborhood for continuous optimization problem. In: Second international workshop on Intelligent systems design and application, pp. 149–154. Dynamic Publishers, Inc. (2002)
Fleischer, M., Jacobson, S.H.: Cybernetic optimization by simulated annealing: an implementation of parallel processing using probabilistic feedback control. In: Kelly, J. (ed.) Metaheuristics: The State of the Art 1995. Proceedings of Metaheuristics International Conference 1995, Kluwer Academic, Dordrecht (1995)
Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of 3rd Annual ACM symposium on the Theory of Computing, pp. 151–158. ACM, New York (1971)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Longman, Amsterdam (1995)
Gu, J.: Multispace search for satisfiability and np-hard problems. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Satisfiability Problem: Theory and Applications: Proceedings of a DIMACS Workshop, vol. 35, pp. 407–517 (1996)
Creignou, N.: The class of problems that are linearly equivalent to satisfiability or a uniform method for proving np-completeness. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 115–133. Springer, Heidelberg (1993)
Davis, M.G., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394–397 (1962)
Spears, W.M.: Simulated annealing for hard satisfiability problems. Technical report, Naval Research Laboratory, Washington D.C (1993)
Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: AAAI 1994: Proceedings of the twelfth national conference on Artificial intelligence, American Association for Artificial Intelligence, vol. 1, pp. 337–343 (1994)
Hirsch, E., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (2001) PDMI preprint 9/2001, Steklov Institute of Mathematics at St.Petersburg (2001)
Mitchell, D.G., Selman, B., Levesque, H.: Hard and easy distributions of sat problems. In: Proceedings of AAAI 1992, pp. 459–465 (1992)
Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: A survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences (1997)
Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT (2000)
Consulting date (December 1, 2004), http://www.satlib.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sanvicente–Sánchez, H., Frausto–Solís, J., Imperial–Valenzuela, F. (2005). Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_31
Download citation
DOI: https://doi.org/10.1007/11496199_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)