Skip to main content
SpringerLink
Log in

Design efficient local search algorithms

  • Planning and Scheduling
  • Conference paper
  • First Online:
Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 604))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. J. Gu. How to solve Very Large-Scale Satisfiability (VLSS) problems. 1988.

    Google Scholar 

  4. J. Gu. Benchmarking SAT algorithms. Technical Report UCECE-TR-90-002, Oct. 1990.

    Google Scholar 

  5. J. Gu. Constraint-Based Search. Cambridge University Press, New York, 1992.

    Google Scholar 

  6. J. Gu and Q.P. Gu. Average time complexities of several local search algorithms. Submitted for publication. Jan. 1992.

    Google Scholar 

  7. R. Sosič and J. Gu. Efficient local search with conflict minimization. IEEE Trans. on Knowledge and Data Engineering, 1992.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Calgary, T2N 1N4, Calgary, Canada

    Jun Gu

Authors
  1. Jun Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fevzi Belli Franz Josef Radermacher

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, J. (1992). Design efficient local search algorithms. In: Belli, F., Radermacher, F.J. (eds) Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. IEA/AIE 1992. Lecture Notes in Computer Science, vol 604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025021

Download citation

  • DOI: https://doi.org/10.1007/BFb0025021

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55601-5

  • Online ISBN: 978-3-540-47251-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation