Abstract
Recently proposed impact based heuristics have been shown to outperform other instances of the first-fail policy such as the common dom and dom/deg heuristics. This paper compares the behaviour of a constraint and a variable centered impact based heuristic and relates it to the amount of constraint propagation inherent to the model of the problem. Additionally, it presents results which suggest that a lookahead impact heuristic we recently proposed might be the best choice for problems with low locality and where constraint propagation plays an important role.
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
Bessiére, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Procs. of IJCAI 1997, Nagoya, Japan, pp. 398–404 (1997)
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, Spain, pp. 146–150. IOS Press, Amsterdam (2004)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceeding of IJCAI 1991, pp. 331–340 (1991)
Correia, M., Barahona, P.: On the integration of singleton consistency and looh-ahead heuristics. In: Procs. of the annual ERCIM workshop on constraint solving and constraint logic programming, Rocquencourt, France (June 2007)
Culberson, J.: Graph coloring resources, http://web.cs.ualberta.ca/~joe/Coloring/Generators/generate.html
Dotu, del Val, Cebrian: Redundant modeling for the quasigroup completion problem. In: ICCP: Int. Conf. on Constraint Programming (CP). LNCS (2003)
Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Procs. of ECAI 1992, New York, NY, USA, pp. 31–35. John Wiley & Sons, Inc., Chichester (1992)
Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI 1996, vol. 1, pp. 246–252 (1996)
Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints 6(4), 345–372 (2001)
Kautz, Ruan, Achlioptas, Gomes, Selman, Stickel: Balance and filtering in structured satisfiable problems. In: Procs. of IJCAI 2001 (2001)
Prosser, P., Stergiou, K., Walsh, T.: Singleton consistencies. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 353–368. Springer, Heidelberg (2000)
Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correia, M., Barahona, P. (2008). On the Efficiency of Impact Based Heuristics. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)