Skip to main content
Springer Nature Link
Log in

Memoisation for Constraint-Based Local Search

  • Conference paper
Principles and Practice of Constraint Programming - CP 2009 (CP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

  • 1807 Accesses

Abstract

We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness of the approach by significantly speeding up the penalty calculation of a commonly used set constraint.

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.

Similar content being viewed by others

References

  1. Michie, D.: Memo functions: a language feature with “rote-learning” properties. Research Memorandum MIP-R-29. Edinburgh: Department of Machine Intelligence & Perception (1967)

    Google Scholar 

  2. Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)

    MATH  Google Scholar 

  3. Van Hentenryck, P., Michel, L.: Differentiable invariants. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 604–619. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Ågren, M., Flener, P., Pearson, J.: Generic incremental algorithms for local search. Constraints 12(3), 293–324 (2007); Collects the results of papers at CP-AI-OR 2005, CP 2005, and CP 2006

    Article  MathSciNet  MATH  Google Scholar 

  5. Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI 1991, pp. 227–233 (1991)

    Google Scholar 

  6. Sellmann, M., Van Hentenryck, P.: Structural symmetry breaking. In: Proceedings of IJCAI 2005, Professional Book Center, pp. 298–303 (2005)

    Google Scholar 

  7. Ågren, M.: Set Constraints for Local Search. PhD thesis, Uppsala University (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swedish Institute of Computer Science, Box 1263, SE, 164 29, Kista, Sweden

    Magnus Ågren

Authors
  1. Magnus Ågren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St. Andrews, North Haugh, St Andrews, KY16 9SX, Fife, Scotland, UK

    Ian P. Gent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ågren, M. (2009). Memoisation for Constraint-Based Local Search. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics