Abstract
We present a hybrid solver (called \(\mathbb{GELATO}\)) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal + + ). \(\mathbb{GELATO}\) allows to easily develop and use hybrid meta-heuristic combining CP and LS phases (in particular Large Neighborhood Search). We tested some hybrid algorithms on different instances of the Asymmetric Traveling Salesman Problem: even if only naive LS strategies have been used, our meta-heuristics improve the standard CP search, in terms of both goodness of the solution reached and execution time. \(\mathbb{GELATO}\) will be integrated into a more general tool to solve Constraint Satisfaction/Optimization Problems. Moreover, it can be seen as a new library for approximate and efficient searching in Gecode.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester (1997)
Cipriano, R., Dovier, A., Mauro, J.: Compiling and executing declarative modeling languages to gecode. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 744–748. Springer, Heidelberg (2008)
Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 817–821. Springer, Heidelberg (2003)
Di Gaspero, L.: Local Search Techniques for Scheduling Problems: Algorithms and Software Tools. PhD thesis, Univ. di Udine, DIMI (2003)
Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software — Practice & Experience 33(8), 733–765 (2003)
Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 369–403. Kluwer, Dordrecht (2003)
Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristic. Artificial Intelligence 139(1), 21–45 (2002)
Monfroy, E., Saubion, F., Lambert, T.: On hybridization of local search and constraint propagation. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 299–313. Springer, Heidelberg (2004)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)
Swedish Institute of Computer Science. Sicstus prolog, http://www.sics.se/isl/sicstuswww/site/index.html
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
Gecode Team. Gecode: Generic constraint development environment, http://www.gecode.org
Institut für Informatik Universität Heidelberg. Tsplib, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Various Authors. CP-AI-OR conference series, http://www.cpaior.org/
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cipriano, R., Di Gaspero, L., Dovier, A. (2009). A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + + . In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-04918-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04917-0
Online ISBN: 978-3-642-04918-7
eBook Packages: Computer ScienceComputer Science (R0)