Hybrid Metaheuristics

Volume 434 of the series Studies in Computational Intelligence pp 389-414

A Multi-paradigm Tool for Large Neighborhood Search

  • Raffaele CiprianoAffiliated withDipartimento di Matematica e Informatica, Università degli Studi di Udine Email author 
  • , Luca Di GasperoAffiliated withDipartimento di Ingegneria Elettrica, Gestionale eMeccanica, Università degli Studi di Udine
  • , Agostino DovierAffiliated withDipartimento di Matematica e Informatica, Università degli Studi di Udine

* Final gross prices may vary according to local VAT.

Get Access


We present a general tool for encoding and solving optimization problems. Problems can be modeled using several paradigms and/or languages such as: Prolog, MiniZinc, and GECODE. Other paradigms can be included. Solution search is performed by a hybrid solver that exploits the potentiality of the Constraint Programming environment GECODE and of the Local Search framework EasyLocal++ for Large Neighborhood Search . The user can modify a set of parameters for guiding the hybrid search. In order to test the tool, we show the development phase of hybrid solvers on some benchmark problems. Moreover, we compare these solvers with other approaches, namely a pure Local Search, a pure constraint programming search, and with a state-of-the-art solver for constraint-based Local Search.