Solver-Independent Large Neighbourhood Search

  • Jip J. DekkerEmail author
  • Maria Garcia de la Banda
  • Andreas Schutt
  • Peter J. Stuckey
  • Guido Tack
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11008)


The combination of large neighbourhood search (LNS) methods with complete search methods has proved to be very effective. By restricting the search to (small) areas around an existing solution, the complete method is often able to quickly improve its solutions. However, developing such a combined method can be time-consuming: While the model of a problem can be expressed in a high-level solver-independent language, the LNS search strategies typically need to be implemented in the search language of the target constraint solvers. In this paper we show how we can simplify this process by (a) extending constraint modelling languages to support solver-independent LNS search definitions, and (b) defining small solver extensions that allow solvers to implement these solver-independent LNS searches. Modellers can then implement an LNS search to be executed in any extended solver, by simply using the modelling language constructs. Experiments show that the resulting LNS searches only introduce a small overhead compared to direct implementations in the search language of the underlying solvers.



This research was partly sponsored by the Australian Research Council grant DP180100151.


  1. 1.
    Chiarandini, M., Gaspero, L.D., Gualandi, S., Schaerf, A.: The balanced academic curriculum problem revisited. J. Heuristics 18(1), 119–148 (2012)CrossRefGoogle Scholar
  2. 2.
    Chu, G.: Improving Combinatorial Optimization. Department of Computing and Information Systems, University of Melbourne (2011)Google Scholar
  3. 3.
    Cipriano, R., Di Gaspero, L., Dovier, A.: Gelato: a multi-paradigm tool for Large Neighborhood Search. In: Talbi, E.-G. (ed.) Hybrid Metaheuristics, pp. 389–414. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Danna, E., Perron, L.: Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 817–821. Springer, Heidelberg (2003). Scholar
  5. 5.
    Fourer, R., Gay, D., Kernighan, B.: AMPL: A Mathematical Programming Language. Manage. Sci. 36, 519–554 (1990)CrossRefGoogle Scholar
  6. 6.
    Frisch, A.M., Harvey, W., Jefferson, C., Martínez-Hernández, B., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints 13(3), 268–306 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gecode Team: Gecode: A Generic Constraint Development Environment (2016).
  8. 8.
  9. 9.
    Michel, L., Van Hentenryck, P.: The Comet Programming Language and System. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 881–881. Springer, Heidelberg (2005). Scholar
  10. 10.
    Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007).
  11. 11.
    OscaR Team: OscaR: Scala in OR (2012).
  12. 12.
    Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Three. IJCAI 11, pp. 1997–2002. AAAI Press, Barcelona (2011)Google Scholar
  13. 13.
    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). Scholar
  14. 14.
    Pisinger, D., and Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Pisinger, D., and Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 399–419. Springer, Boston (2010). ISBN: 978-1-4419-1665-5. Scholar
  16. 16.
    Prud’homme, C., Fages, J.-G., Lorca, X.: Choco documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017).
  17. 17.
    Prud’homme, C., Lorca, X., Jussien, N.: Explanation-Based Large Neighborhood Search. Constraints 19(4), 339–379 (2014)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Rendl, A., Guns, T., Stuckey, P.J., Tack, G.: MiniSearch: a solver-independent meta-search language for MiniZinc. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 376–392. Springer, Cham (2015). Scholar
  19. 19.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)CrossRefGoogle Scholar
  20. 20.
    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). Scholar
  21. 21.
    Stuckey, P.J., Becket, R., Fischer, J.: Philosophy of the MiniZinc challenge. Constraints 15(3), 307–316 (2010)CrossRefGoogle Scholar
  22. 22.
    Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J.: The MiniZinc challenge 2008–2013. AI Mag. 35(2), 55–60 (2014)CrossRefGoogle Scholar
  23. 23.
    Stuckey, P.J., Tack, G.: MiniZinc with functions. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 268–283. Springer, Heidelberg (2013). Scholar
  24. 24.
    Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)Google Scholar
  25. 25.
    Van Hentenryck, P., Michel, L.: OPL script: composing and controlling models. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds.) WC 1999. LNCS (LNAI), vol. 1865, pp. 75–90. Springer, Heidelberg (2000). Scholar
  26. 26.
    Van Hentenryck, P., Michel, L.: The Objective-CP optimization system. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 8–29. Springer, Heidelberg (2013). Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Monash UniversityMelbourneAustralia
  2. 2.Data61, CSIROMelbourneAustralia

Personalised recommendations