Abstract
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis of the performance of these algorithms. The performance measures we consider are the probability of finding a satisfying assignment and the distribution of the best solution observed on a given SAT instance. The analysis provides exact statistics, but is restricted to small problems as it requires the storage and use of knowledge about the entire search space. We examine the effect of p, the probability of making non-greedy moves, on these algorithms and provide a justification for the practice of choosing this value empirically.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. H. L. Aarts and J. H. M. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1989.
J. R. Cruz and C. C. Y. Dorea, “Simple conditions for the convergence of simulated annealing type algorithms,” Journal of Applied Probability, vol. 35, no. 4, p. 885–92, December 1998.
A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, “Global convergence of genetic algorithms: a markov chain analysis,” Parallel Problem Solving from Nature, PPSN 1, p. 4–12, October 1990.
J. Gu, “Efficient Local Search for Very Large Scale Satisfiability Problems,” Sigart Bulletin, vol. 3, no. 1, p. 8–12, 1992.
J. Hansen and B. Jaumard, “Algorithms for the maximum satisfiability problem,” Computing, vol. 44, pp. 279–303, 1990.
D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, “How easy is local search?,” Journal of Computer and System Sciences, vol. 37, no. 1, p. 79–100, August 1998.
C. Y. Mao and Y. H. Hu, “Analysis of Convergence Properties of a Stochastic Evolution Algorithm,” IEEE Transactions on Computer-Aided Design of integrated circuits and systems, vol. 15, no. 7, July 1996.
D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, “Convergence and finite-time behavior of simulated annealing,” Proceedings of the 24th IEEE Conference on Decision and Control, vol. 2, p. 761–7, December 1985.
A. E. Nix and M. D. Vose, “Modeling genetic algorithms with Markov Chains,” Annals of Mathematics and Artificial Intelligence, vol. 5, no. 1, p. 79–88.
C. H. Papadimitriou, A. A. Schaffer, M. Yannakis, “On the complexity of local search,” Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, p. 438–45, May 1990.
G. Rudolph, “Convergence Analysis of Canonical Genetic Algorithms,” IEEE Transactions on Neural Networks, vol. 5, no. 1, January 1994.
B. Selman, H. J. Levesque and D. G. Mitchell, “A new Method for Solving Hard Satisfiability Problems, Proceedings AAAI-92, San Jose, CA, pp. 440–446, 1992.
B. Selman, H. A. Kautz, and B. Cohen, “Local Search Strategies for Satisfiability Testing,” Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, October 1993.
B. Selman, H. A. Kautz, and B. Cohen, “Noise Strategies for Improving Local Search,” Proceedings of Twelfth National Conference on Artificial Intelligence, AAAI-94, vol. 1, pp. 337–43, July 1994.
G. B. Sorkin, “Efficient simulated annealing on fractal energy landscapes,” Algorithmica, vol. 6, no. 3, p. 367–418, 1991.
J. C. Spall, S. D. Hill, D. R. Stark, “Theoretical Comparisons of Evolutionary Computation and Other Optimization Approaches,” Congress on Evolutionary Computation, vol. 2, p. 1398–405, July 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnamachari, B., Xie, X., Selman, B., Wicker, S. (2000). Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive