Abstract
We investigate the benefit of Tabu Search for satisfiability (SAT) and constraint satisfaction problems (CSP and compare it to the more frequently used random walk heuristic. We argue, that a more deterministic direction of search as done with Tabu Search is worth considering also for SAT and CSP. We give experimental evidence that Tabu Search can be used to efficiently guide local search procedures like GSAT and WSAT for SAT and the min conflicts heuristic for CSP. The algorithms are tested on randomly generated problems and hard graph coloring instances from the DIMACS benchmark test set. Additionally, we give some explanation on the value of Tabu Search.[/ p]
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Bennaceur. The Satisfiability Problem Regarded as a Constraint Satisfaction Problem. In Wolfgang Wahlster, editor, ECAI'96, pages 155–160. John Wiley & Sons, Chichester, 1996.
A. Davenport, E. Tsang, C.J. Wang, and K. Zhu. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. In AAAI'94, 1994.
J. de Kleer. A Comparison of ATMS and CSP Techniques. In IJCAI'89. Morgan Kaufmann, 1989.
I. P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In AAAI'93, pages 28–33. MIT press, 1993.
I.P. Gent and T. Walsh. An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research, 1:47–59, 1993.
F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1(3:190–206, 1989.
P. Hansen and B. Jaumard. Algorithms for the Maximum Satisfiability Problem. Computing, 44:279–303, 1990.
H. H. Hoos. Solving hard combinatorial problems with GSAT — a case study. In KI-96, volume 1137 of LNAI, pages 107–119. Springer Verlag, 1996.
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39(3):378–406, 1991.
H. Kautz and B. Selman. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In AAAI'96, volume 2, pages 1194–1201. MIT Press, 1996.
B. Mazure, L. Sais, and E. Gregoire. TWSAT: A New Local Search Algorithm for SAT — Performance and Analysis. In CP'95 Workshop on Solving Hard Problems, 1995.
S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence, 52:161–205, 1992.
P. Morris. The Breakout Method for Escaping from Local Minima. In AAAI'93, pages 40–45, 1993.
B. Selman and Henry A. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In IJCAI'93, pages 290–295, 1993.
B. Selman, Henry A. Kautz, and Bram Cohen. Noise Strategies for Improving Local Search. In AAAI'94, pages 337–343. MIT press, 1994.
B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In AAAI'92, pages 440–446. MIT press, 1992.
Bart Selman, David G. Mitchell, and Hector J. Levesque. Generating Hard Satisfiability Problems. Artificial Intelligence, 81(1-2):17–30, 1996.
B.M. Smith. Phase Transitions and the Mushy Region in Constraint Satisfaction Problems. In ECAI'94, pages 100–104, 1994.
Olaf Steinmann. Kombinatorische Probleme, Optimierung und Parallelisierung: Eine experimentelle Analyse von Multi-Flip-Netzwerken. Master's thesis, TH Darmstadt, FB Informatik, FG Intellektik, 1997.
Richard J. Wallace. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. In Constraint Programming 96, LNCS, pages 482–496. Springer Verlag, 1996.
R.J. Wallace and E. Freuder. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems. In Over-Constrained Systems, volume 1106 of Lecture Notes in Computer Science. Springer Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinmann, O., Strohmaier, A., Stützlel, T. (1997). Tabu search vs. Random walk. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_27
Download citation
DOI: https://doi.org/10.1007/3540634932_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63493-5
Online ISBN: 978-3-540-69582-0
eBook Packages: Springer Book Archive