Abstract
In this paper we present a local search constraint solver in which constraints are expressed using cost functions on graph structures of filter constraints of equal type. A similar theoretical approach has previously been used to model a large number of complex global constraints, which motivates the use of such a model in practice. In a local search context, we view global constraints as complex cost functions, encapsulating the structure of the constraints using a graph of variables, values and filter constraints. This representation gives us a declarative model, which can also be used to efficiently compute a cost as well as conflict levels of the variables in the constraints. We have implemented these ideas in a compositional C++ framework called Composer, which can be used to solve systems of graph-based constraints. We demonstrate the usability of this approach on several well-known global constraints, and show by experimental results on two problems that an approach using a graph basis for global constraint modeling is not only possible in practice, but also competitive with existing constraint-based local search systems.
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
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 1990, pp. 32–42 (1990)
Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 52–66. Springer, Heidelberg (2000)
Beldiceanu, N.: Global constraints as graph properties on structured networks of elementary constraints of the same type. Technical Report 2000/01-SE, SICS (2000)
Beldiceanu, N., Petit, T.: Cost evaluation of soft global constraints. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 80–95. Springer, Heidelberg (2004)
Bohlin, M.: Design and Implementation of a Graph-Based Constraint Model for Local Search. Philosophy Licentiate Thesis No. 27, Mälardalen University (April 2004)
Bohlin, M., Kocjan, W., Kreuger, P.: Designing global scheduling constraints for local search: A generic approach. Technical Report T2002-20, SICS (2002)
Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 73–90. Springer, Heidelberg (2001)
Galinier, P., Hao, J.-K.: Solving the progressive party problem by local search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, ch. 29, pp. 418–432. Kluwer, Dordrecht (1998)
Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. In: Proc. CP-AI-OR 2000, Paderborn, Germany (March 2000)
Glover, F., Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Optimization, ch. 3, pp. 70–150. McGraw-Hill, New York (1995)
Michel, L.: Personal communication (September 2003)
Michel, L., Hentenryck, P.V.: Localizer: A modeling language for local search. In: Principles and Practice of Constraint Programming, pp. 237–251 (1997)
Michel, L., Hentenryck, P.V.: Localizer++: An open library for local search. Technical Report CS-01-02, Brown University (January 2001)
Michel, L., Hentenryck, P.V.: A constraint-based architecture for local search. In: 17th ACM OOPSLA Conference (November 2002)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58(1–3), 161–205 (1992)
Nareyek, A.: Using global constraints for local search. In: Proc. DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, pp. 1–18 (1998)
Paige, R., Koenig, S.: Finite differencing of computable expressions. ACM Transactions on Programming Languages and Systems 4(3), 402–454 (1982)
Petit, T., Regin, J.-C., Bessiere, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451–463. Springer, Heidelberg (2001)
Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. 12th National Conference on AI, Seattle, Washington, pp. 362–367 (1994)
Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proc. 13th National Conference on AI, Portland, August 1996, vol. 1, pp. 209–215 (1996)
Sosic, R., Gu, J.: Efficient local search with conflict minimization: A case study of the n-queens problem. IEEE Trans. Knowledge and Data Eng. 6(5), 661–668 (1994)
Walser, J.P.: Integer Optimization by Local Search. LNCS (LNAI), vol. 1637. Springer, Heidelberg (1999)
Yellin, D., Strom, R.: INC: a language for incremental computations. SIGPLAN Not. 23(7), 115–124 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bohlin, M. (2005). A Local Search System for Solving Constraint Problems of Declarative Graph-Based Global Constraints. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2004 2004. Lecture Notes in Computer Science(), vol 3392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415763_11
Download citation
DOI: https://doi.org/10.1007/11415763_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25560-4
Online ISBN: 978-3-540-32124-8
eBook Packages: Computer ScienceComputer Science (R0)