Abstract
In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)
Beck, J.C., Prosser, P., Wallace, R.J.: Variable Ordering Heuristics Show Promise. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 711–715. Springer, Heidelberg (2004)
Caseau, Y., Laburthe, F.: Improved clp scheduling with task intervals. In: Proc. of ICLP 1994, pp. 369–383. MIT Press, Cambridge (1994)
Castro, C., Monfroy, E.: Designing hybrid cooperations with a component language for solving optimisation problems. In: Bussler, C.J., Fensel, D. (eds.) AIMSA 2004. LNCS, vol. 3192, pp. 447–458. Springer, Heidelberg (2004)
Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57. Kluwer Academic Publishers, Dordrecht (2002)
Hoos, H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
Hulubei, T., O’Sullivan, B.: Search heuristics and heavy-tailed behaviour. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 328–342. Springer, Heidelberg (2005)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artif. Intell. 139(1), 21–45 (2002)
Kamarainen, O., Sakkout, H.E.: Local probing applied to network routing. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 173–189. Springer, Heidelberg (2004)
Mazure, B., Sais, L., Grégoire, É.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell. 22(3-4), 319–331 (1998)
Monfroy, E., Saubion, F., Lambert, T.: Hybrid CSP solving. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol. 3717, pp. 138–167. Springer, Heidelberg (2005)
Prestwich, S.D.: A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 337–352. Springer, Heidelberg (2000)
Prestwich, S.: Local search and backtracking vs non-systematic backtracking. In: Proceedings of AAAI 2001, Fall Symposium on Using Uncertainty within Computation, pp. 109–115. AAAI Press, Menlo Park (2001); Technical Report FS-01-04
Wallace, M.: Hybrid algorithms, local search, and Eclipse. CP Summer School 2005 (2005), http://www.math.unipd.it/~frossi/cp-school/wallace-lec_notes.pdf
Wallace, M., Schimpf, J.: Finding the right hybrid algorithm - a combinatorial meta-problem. Ann. Math. Artif. Intell. 34(4), 259–269 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monfroy, E., Castro, C., Crawford, B. (2006). Using Local Search for Guiding Enumeration in Constraint Solving. In: Euzenat, J., Domingue, J. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2006. Lecture Notes in Computer Science(), vol 4183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861461_8
Download citation
DOI: https://doi.org/10.1007/11861461_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40930-4
Online ISBN: 978-3-540-40931-1
eBook Packages: Computer ScienceComputer Science (R0)