Abstract
One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates that traditional combinators from constraint programming have natural counterparts for local search, although their underlying computational model is radically different. In particular, the paper shows that constraint combinators, such as logical and cardinality operators, reification, and first-class expressions can all be viewed as differentiable objects. These combinators naturally support elegant and efficient modelings, generic search procedures, and partial constraint satisfaction techniques for local search. Experimental results on a variety of applications demonstrate the expressiveness and the practicability of the combinators.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Codognet, C., Diaz, D.: Yet Another Local Search Method for Constraint Solving. In: AAAI Fall Symposium on Using Uncertainty within Computation (2001)
Di Gaspero, L., Schaerf, A.: Writing Local Search Algorithms Using EasyLocal++. In: Optimization Software Class Libraries, Kluwer, Dordrecht (2002)
Freuder, E.: Partial Constraint Satisfaction. Artificial Intelligence 58 (1992)
Galinier, P., Hao, J.-K.: A General Approach for Constraint Solving by Local Search. In: CP-AI-OR 2000, Paderborn, Germany (March 2000)
Ilog Solver 4.4. Reference Manual. Ilog SA, Gentilly, France (1998)
Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Operations Research 37(6), 865–893 (1989)
Laburthe, F., Caseau, Y.: SALSA: A Language for Search Algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 310. Springer, Heidelberg (1998)
Michel, L., Van Hentenryck, P.: Localizer. Constraints 5, 41–82 (2000)
Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: OOPSLA 2002 (2002)
Michel, L., Van Hentenryck, P.: A Simple Tabu Search for Warehouse Location. European Journal of Operational Research (2004) (in press)
Minton, S., Johnston, M.D., Philips, A.B.: Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In: AAAI 1990 (1990)
Nareyek, A.: Constraint-Based Agents. Springer, Heidelberg (1998)
Nareyek, A.: DragonBreath (2004), www.ai-center.com/projects/dragonbreath/
Ramalingam, G.: Bounded Incremental Computation. PhD thesis, University of Wisconsin-Madison (1993)
Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Improving Local Search. In: AAAI 1994, pp. 337–343 (1994)
Shaw, P., De Backer, B., Furnon, V.: Improved local search for CP toolkits. Annals of Operations Research 115, 31–50 (2002)
Van Hentenryck, P., Michel, L.: Control Abstractions for Local Search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 65–80. Springer, Heidelberg (2003) (Best Paper Award)
Voss, S., Woodruff, D.: Optimization Software Class Libraries. Kluwer Academic Publishers, Dordrecht (2002)
Voudouris, C., Tsang, E.: Partial constraint satisfaction problems and guided local search. In: PACT 1996, pp. 337–356 (1996)
Walser, J.: Integer Optimization by Local Search. Springer, Heidelberg (1998)
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
Van Hentenryck, P., Michel, L., Liu, L. (2004). Constraint-Based Combinators for Local Search. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive