Advertisement

Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers

  • Emir DemirovićEmail author
  • Geoffrey Chu
  • Peter J. Stuckey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11008)

Abstract

Large neighbourhood search, a meta-heuristic, has proven to be successful on a wide range of optimisation problems. The algorithm repeatedly generates and searches through a neighbourhood around the current best solution. Thus, it finds increasingly better solutions by solving a series of simplified problems, all of which are related to the current best solution. In this paper, we show that significant benefits can be obtained by simulating local-search behaviour in constraint programming by using phase saving based on the best solution found so far during the search, activity-based search (VSIDS), and nogood learning. The approach is highly effective despite its simplicity, improving the highest scoring solver, Chuffed, in the free category of the MiniZinc Challenge 2017, and can be easily integrated into modern constraint programming solvers. We validated the results on a wide range of benchmarks from the competition library, comparing against seventeen state-of-the-art solvers.

Notes

Acknowledgements

We would like to thank Andreas Schutt for his exceptional assistance with comparing solvers and Graeme Gange for his insight on the implementation.

References

  1. 1.
    Roig, I.A.: Solving hard industrial combinatorial problems with SAT. Ph.D. thesis, Technical University of Catalonia (UPC) (2013)Google Scholar
  2. 2.
    Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI 2004, pp. 146–150 (2004)Google Scholar
  3. 3.
    Carchrae, T., Beck, J.C.: Principles for the design of large neighborhood search. J. Math. Model. Algorithms 8(3), 245–270 (2009)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chu, G.: Improving combinatorial optimization. Ph.D. thesis, The University of Melbourne (2011)Google Scholar
  5. 5.
    Haralick, R., Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263–313 (1980)CrossRefGoogle Scholar
  6. 6.
    Lombardi, M., Schaus, P.: Cost impact guided LNS. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 293–300. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-07046-9_21CrossRefGoogle Scholar
  7. 7.
    Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Proc. Let. 47(4), 173–180 (1993)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of DAC 2001, pp. 530–535 (2001)Google Scholar
  9. 9.
    Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357–391 (2009)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468–481. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-30201-8_35CrossRefGoogle Scholar
  11. 11.
    Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-72788-0_28CrossRefGoogle Scholar
  12. 12.
    Prud’homme, C., Lorca, X., Jussien, N.: Explanation-based large neighborhood search. Constraints 19(4), 339–379 (2014)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-30201-8_41CrossRefzbMATHGoogle Scholar
  14. 14.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998).  https://doi.org/10.1007/3-540-49481-2_30CrossRefGoogle Scholar
  15. 15.
    Walsh, T.: Search in a small world. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 1172–1177 (1999)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Emir Demirović
    • 1
    Email author
  • Geoffrey Chu
    • 1
  • Peter J. Stuckey
    • 1
  1. 1.School of Computing and Information SystemsUniversity of MelbourneMelbourneAustralia

Personalised recommendations