Abstract
Autonomous search is a recent approach that allows the solver to adapt their search so as to be more efficient without the manual configuration of an expert user. The goal is to provide more capabilities to the solver in order to improve the search process based on some performance indicators and self-tuning. This approach has effectively been applied to different optimization and satisfaction techniques such as constraint programming, SAT, and various metaheuristics. This paper focuses on automated self-tuning of constraint programming solvers. We employ a classic decision making method called weighted sum model (WSM) to evaluate the search process performance. This evaluation is used by the solver to re-configure its parameters in benefit of reaching a better performance. However, reaching good configurations straightly depends on the correct tuning of the WSM. This is known to be hard as the WSM is problem-dependent and good settings are not commonly stable along the search. To this end, we introduce a gravitational search algorithm (GSA), which is able to find good WSM configurations when solving constraint satisfaction problems. We illustrate experimental results where the GSA-based approach directly competes against previously reported autonomous search methods for constraint programming.
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
Barták, R., Rudová, H.: Limited assignments: A new cutoff strategy for incomplete depth-first search. In: Proceedings of the 20th ACM Symposium on Applied Computing (SAC), pp. 388–392 (2005)
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)
Crawford, B., Soto, R., Castro, C., Monfroy, E.: A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction. In: Ferrández, J.M., Álvarez Sánchez, J.R., de la Paz, F., Toledo, F.J. (eds.) IWINAC 2011, Part II. LNCS, vol. 6687, pp. 295–304. Springer, Heidelberg (2011)
Crawford, B., Soto, R., Castro, C., Monfroy, E., Paredes, F.: An Extensible Autonomous Search Framework for Constraint Programming. Int. J. Phys. Sci. 6(14), 3369–3376 (2011)
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 Systems with Applications 40(5), 1690–1695 (2013)
Halliday, D., Resnick, R., Walker, J.: Fundamentals of Physics. Halliday & Resnick Fundamentals of Physics. John Wiley & Sons Canada, Limited (2010)
Hamadi, Y., Monfroy, E., Saubion, F.: Autonomous Search. Springer (2012)
Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 213–228. Springer, Heidelberg (2006)
Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186–202. Springer, Heidelberg (2010)
Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello Coello, C.A. (ed.) LION 2011. LNCS, vol. 6683, pp. 507–523. Springer, Heidelberg (2011)
Maturana, J., Lardeux, F., Saubion, F.: Autonomous operator management for evolutionary algorithms. J. Heuristics 16(6), 881–909 (2010)
Maturana, J., Saubion, F.: On the design of adaptive control strategies for evolutionary algorithms. In: Monmarché, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 303–315. Springer, Heidelberg (2008)
Maturana, J., Saubion, F.: A compass to guide genetic algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 256–265. Springer, Heidelberg (2008)
Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A Reactive and Hybrid Constraint Solver. J. Exp. Theor. Artif. Intell. (2012) (in press), doi:10.1080/0952813X.2012.656328
Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using Autonomous Search for Generating Good Enumeration Strategy Blends in Constraint Programming. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 607–617. Springer, Heidelberg (2012)
Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: A gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Schutz, B.: Gravity from the ground up. Cambridge University Press (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Soto, R., Crawford, B., Herrera, R., Olivares, R., Johnson, F., Paredes, F. (2015). WSM Tuning in Autonomous Search via Gravitational Search Algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol 347. Springer, Cham. https://doi.org/10.1007/978-3-319-18476-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-18476-0_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18475-3
Online ISBN: 978-3-319-18476-0
eBook Packages: EngineeringEngineering (R0)