Abstract
In this paper, we report the main results of a study which has been carried out about the multiple ways of parameterising a local search in the space of the partial assignments of a Constraint Satisfaction Problem (CSP), an algorithm which is directly inspired from the decision repair algorithm [1]. After a presentation of the objectives of this study, we present the generic algorithm we started from, the various parameters that must be set to get an actual algorithm, and some potentially interesting algorithm instances. Then, we present experimental results on randomly generated, but not completely homogeneous, binary CSPs, which show that some specific parameter settings allow such a priori incomplete algorithms to solve almost all the consistent and inconsistent problem instances on the whole constrainedness spectrum. Finally, we conclude with the work that remains to do if we want to acquire a better knowledge of the best parameter settings for a local search in the space of partial assignments.
The study reported in this paper has been initiated when both authors were working at ONERA, Toulouse, France.
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
Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflictbased Heuristics. Artificial Intelligence 139 (2002)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press Ltd., London (1993)
Dechter, R., Pearl, J.: Network-based Heuristics for Constraint Satisfaction Problems. Artificial Intelligence 34 (1987)
Haralick, R., Elliot, G.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14 (1980)
Sabin, D., Freuder, E.: Contradicting Conventional Wisdom in Constraint Satisfaction. In: Proc. of ECAI (1994)
Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problems. Computational Intelligence 9 (1993)
Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58 (1992)
Aarts, E., Lenstra, J. (eds.): Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester (1997)
Langley, P.: Systematic and Nonsystematic Search Strategies. In: Proc. of AAAI (1992)
Kask, K., Dechter, R.: GSAT and Local Consistency. In: Proc. of IJCAI (1995) 241
Schaerf, A.: Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems. In: Proc. of IJCAI (1997)
Zhang, J., Zhang, H.: Combining Local Search and Backtracking Techniques for Constraint Satisfaction. In: Proc. of AAAI (1996)
Pesant, G., Gendreau, M.: A View of Local Search in Constraint Programming. In: Proc. of CP (1996)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Proc. of CP (1998)
Lobjois, L., Lemaˆıtre, M., Verfaillie, G.: Large Neighbourhood Search using Constraint Propagation and Greedy Reconstruction for Valued CSP Resolution In: Proc. of the ECAI Workshop on ”Modelling and Solving with Constraints” (2000) 241
Ginsberg, M.: Dynamic Backtracking. Journal of Artificial Intelligence Research 1 (1993)
Jussien, N., Debruyne, R., Boizumault, P.: Maintaining Arc-Consistency within Dynamic Backtracking. In: Proc. of CP (2000)
Ginsberg, M., McAllester, D.: GSAT and Dynamic Backtracking. In: Proc. of KR (1994)
Bliek, C.: Generalizing Partial Order and Dynamic Backtracking. In: Proc. of AAAI (1998)
Prestwich, S.: Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search. Annals of Operations Research 115 (2002)
Berlandier, P., Neveu, B.: Maintaining Arc Consistency through Constraint Retraction. In: Proc. of ICTAI (1994)
Georget, Y., Codognet, P., Rossi, F.: Constraint Retraction in CLP(FD): Formal Framework and Performance Results. Constraints : An International Journal 4 (1999)
Bessière, C.: Arc-Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. of AAAI (1991)
Debruyne, R.: Arc-Consistency in Dynamic CSPs is no more Prohibitive. In: Proc. of ICTAI (1996)
Fages, F., Fowler, J., Sola, T.: Experiments in Reactive Constraint Logic Programming. Journal of Logic Programming 37 (1998)
Sabin, D., Freuder, E.: Understanding and Improving the MAC Algorithm. In: Proc. of CP (1997)
Gomes, C., Selman, B., Kautz, H.: Boosting Combinatorial Search Trough Randomization. In: Proc. of AAAI (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
Pralet, C., Verfaillie, G. (2004). Travelling in the World of Local Searches in the Space of Partial Assignments. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive