Abstract
For many real world problems, modeled as Constraint Satisfaction Problems, there are no known efficient algorithms to solve them. The specialized literature offers a variety of solvers, which have shown satisfactory performance. Nevertheless, despite the efforts of the scientific community in developing new strategies, there is no algorithm that is the best for all possible situations. Then, several approaches have emerged to deal with the Algorithm Selection Problem. Here, we sketch the use a Choice Function for guiding a Constraint Programming solver exploiting search process features to dynamically adapt it in order to more efficiently solve Constraint Satisfaction Problems. To determine the best set of parameters of the choice function, an upper-level metaheuristic is used. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem.
Chapter PDF
Similar content being viewed by others
Keywords
References
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press (2003)
Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 41–55. Springer, Heidelberg (2005)
Beck, J.C., Prosser, P., Wallace, R.J.: Variable ordering heuristics show promise. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 711–715. Springer, Heidelberg (2004)
Christopher Beck, J., Prosser, P., Wallace, R.J.: Toward understanding variable ordering heuristics for constraint satisfaction problems. In: Fourteenth Irish Artificial Intelligence and Cognitive Science Conference (AICS), pp. 11–16 (2003)
Castro, C., Monfroy, E., Figueroa, C., Meneses, R.: An Approach for Dynamic Split Strategies in Constraint Solving. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds.) MICAI 2005. LNCS (LNAI), vol. 3789, pp. 162–174. Springer, Heidelberg (2005)
Chenouard, R., Granvilliers, L., Sebastian, P.: Search heuristics for constraint-aided embodiment design. AI EDAM 23(2), 175–195 (2009)
Crawford, B., Castro, C., Monfroy, E.: Integration of Constraint Programming and Metaheuristics. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 397–398. Springer, Heidelberg (2007)
Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving. In: Schütze, O., Coello Coello, C.A., Tantar, A.-A., Tantar, E., Bouvry, P., Del Moral, P., Legrand, P. (eds.) EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation II. AISC, vol. 175, pp. 171–188. Springer, Heidelberg (2012)
Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690–1695 (2013)
de la Barra, C.L., Crawford, B.: Fostering Creativity Thinking in Agile Software Development. In: Holzinger, A. (ed.) USAB 2007. LNCS, vol. 4799, pp. 415–426. Springer, Heidelberg (2007)
Hamadi, Y., Monfroy, E., Saubion, F.: What is autonomous search? Technical Report MSR-TR-2008-80, Microsoft Research (2008)
Kaplan, R.S.: Conceptual Foundations of the Balanced Scorecard. SSRN eLibrary (2010)
Monfroy, E., Castro, C., Crawford, B.: Adaptive enumeration strategies and metabacktracks for constraint solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol. 4243, pp. 354–363. Springer, Heidelberg (2006)
Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artif. Intell. 86(1), 1–41 (1996)
Smith, S.F., Cheng, C.: Slack-based heuristics for constraint satisfaction scheduling. In: AAAI, pp. 139–144 (1993)
Sturdy, P.: Learning Good Variable Orderings. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, p. 997. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Barra, C.L., Crawford, B., Soto, R., Monfroy, E. (2013). Adaptive and Multilevel Approach for Constraint Solving. In: Stephanidis, C. (eds) HCI International 2013 - Posters’ Extended Abstracts. HCI 2013. Communications in Computer and Information Science, vol 373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39473-7_129
Download citation
DOI: https://doi.org/10.1007/978-3-642-39473-7_129
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39472-0
Online ISBN: 978-3-642-39473-7
eBook Packages: Computer ScienceComputer Science (R0)