Abstract
Hybridization of local search and constraint programming techniques for solving Constraint Satisfaction Problems is generally restricted to some kind of master-slave combinations for specific classes of problems. In this paper we propose a theoretical model based on K.R. Apt’s chaotic iterations for hybridization of local search and constraint propagation. Hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. Our framework opens up new and finer possibilities for hybridization/combination strategies. We also present some combinations of techniques such as tabu search, node and bound consistencies. Some experimental results show the interest of our model to design such hybridization.
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.
Similar content being viewed by others
References
Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester (1997)
Apt, K.: From chaotic iteration to constraint propagation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 36–55. Springer, Heidelberg (1997)
Apt, K.: The rough guide to constraint propagation. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 1–23. Springer, Heidelberg (1999)
Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of Metaheuristics, Kluwer, Dordrecht (2002)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Granvilliers, L., Monfroy, E.: Implementing Constraint Propagation by Composition of Reductions. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 300–314. Springer, Heidelberg (2003)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence 139(1), 21–45 (2002)
Mackworth, A.: Constraint Satisfaction. In: Encyclopedia on Artificial Intelligence, John Wiley, Chichester (1987)
Mariott, K., Stuckey, P.: Programming with Constraints, An introduction. MIT Press, Cambridge (1998)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)
Pesant, G., Gendreau, M.: A view of local search in constraint programming. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 353–366. Springer, Heidelberg (1996)
Prestwich, S.: A hybrid search architecture applied to hard random 3-sat and lowautocorrelation binary sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 337–352. Springer, Heidelberg (2000)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monfroy, E., Saubion, F., Lambert, T. (2004). On Hybridization of Local Search and Constraint Propagation. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive