Local search is one of the early techniques proposed during the midsixties as a practical technique to cope with the overwhelming computational intractability of NP-hard combinatorial optimization problems. In this paper, we give two cases of using local search to solve the n-queens problem and the satisfiability (SAT) problem. We have found that most practical constraint satisfaction problems (CSP) and constraint-based optimization problems can be solved by local search efficiently.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing, pages 151–158, 1971.Google Scholar
  2. [2]
    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.Google Scholar
  3. [3]
    J. Gu. How to solve Very Large-Scale Satisfiability (VLSS) problems. 1988.Google Scholar
  4. [4]
    J. Gu. Benchmarking SAT algorithms. Technical Report UCECE-TR-90-002, Oct. 1990.Google Scholar
  5. [5]
    J. Gu. Constraint-Based Search. Cambridge University Press, New York, 1992.Google Scholar
  6. [6]
    J. Gu and Q.P. Gu. Average time complexities of several local search algorithms. Submitted for publication. Jan. 1992.Google Scholar
  7. [7]
    R. Sosič and J. Gu. Efficient local search with conflict minimization. IEEE Trans. on Knowledge and Data Engineering, 1992.Google Scholar
  8. [8]
    H. S. Stone and J. M. Stone. Efficient search techniques — an empirical study of the n-queens problem. IBM J. Res. Develop., 31(4):464–474, July 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Jun Gu
    • 1
  1. 1.Department of Electrical EngineeringUniversity of CalgaryCalgaryCanada

Personalised recommendations