Abstract
For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. These are known as conflicting variables. We propose a new definition for measuring the conflict of a variable in a model and apply it to the set variables of models expressed in existential second-order logic extended with counting (∃ SOL + ). Such a variable conflict can be automatically and incrementally evaluated. Furthermore, this measure is lower-bounded by an intuitive conflict measure, and upper-bounded by the penalty of the model. We also demonstrate the usefulness of the approach by replacing a built-in global constraint by an ∃ SOL + version thereof, while still obtaining competitive results.
This research was partially funded by EuroControl project C/1.246/HQ/JC/04.
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
Ågren, M., Flener, P., Pearson, J.: Incremental algorithms for local search from existential second-order logic. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709. Springer, Heidelberg (2005)
Ågren, M., Flener, P., Pearson, J.: Set variables and local search. In: Proceedings of CP-AI-OR 2005. Springer, Heidelberg (2005)
Ågren, M., Flener, P., Pearson, J.: Inferring variable conflicts for local search. Tech. Rep. 2006-005, Dept. of Information Technology, Uppsala University (2006)
Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. In: Proceedings of CP-AI-OR 2000 (2000)
Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)
Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: Proceedings of OOPSLA 2002 (2002)
Smith, B.M., et al.: The progressive party problem: Integer linear programming and constraint programming compared. Constraints 1, 119–138 (1996)
Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
Van Hentenryck, P., Michel, L., Liu, L.: Constraint-based combinators for local search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)
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
Ågren, M., Flener, P., Pearson, J. (2006). Inferring Variable Conflicts for Local Search. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_47
Download citation
DOI: https://doi.org/10.1007/11889205_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)