Skip to main content
Springer Nature Link
Log in

Using Autonomous Search for Generating Good Enumeration Strategy Blends in Constraint Programming

  • Conference paper
Computational Science and Its Applications – ICCSA 2012 (ICCSA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7335))

Included in the following conference series:

Abstract

In Constraint Programming, enumeration strategies play an important role, they can significantly impact the performance of the solving process. However, choosing the right strategy is not simple as its behavior is commonly unpredictable. Autonomous search aims at tackling this concern, it proposes to replace bad performing strategies by more promising ones during the resolution. This process yields a combination of enumeration strategies that worked during the search phase. In this paper, we focus on the study of this combination by carefully tracking the resolution. Our preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Best Blends Experiments, http://www.inf.ucv.cl/~rsoto/best_blends (visited November 2011)

  2. 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)

    Google Scholar 

  3. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI), pp. 146–150. IOS Press (2004)

    Google Scholar 

  4. Crawford, B., Castro, C., Monfroy, E.: Using a Choice Function for Guiding Enumeration in Constraint Solving. In: Proceedings of the 9th Mexican International Conference on Artificial Intelligence (MICAI), pp. 37–42. IEEE Computer Society (2010)

    Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-Based Autonomous Search. In: Stephanidis, C. (ed.) Posters, HCII 2011, Part I. CCIS, vol. 173, pp. 561–565. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. 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 (2010)

    Google Scholar 

  8. Crawford, B., Soto, R., Montecinos, M., Castro, C., Monfroy, E.: A Framework for Autonomous Search in the Eclipse Solver. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds.) IEA/AIE 2011, Part I. LNCS, vol. 6703, pp. 79–84. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Epstein, S.L., Freuder, E.C., Wallace, R.J., Morozov, A., Samuels, B.: The Adaptive Constraint Engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 525–542. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Grimes, D., Wallace, R.J.: Learning to identify global bottlenecks in constraint satisfaction search. In: Proceedings of the Twentieth International Florida Artificial Intelligence Research Society (FLAIRS) Conference, pp. 592–597. AAAI Press (2007)

    Google Scholar 

  11. Hamadi, Y., Monfroy, E., Saubion, F.: Special issue on autonomous search. Contraint Programming Letters 4 (2008)

    Google Scholar 

  12. Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)

    Google Scholar 

  13. Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, University of Nottingham School of Computer Science (2009)

    Google Scholar 

  14. Wallace, R.J., Grimes, D.: Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63(1-3), 114–129 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pontificia Universidad Católica de Valparaíso, Chile

    Ricardo Soto, Broderick Crawford & Víctor Bustos

  2. CNRS, LINA, Université de Nantes, France

    Eric Monfroy

Authors
  1. Ricardo Soto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Broderick Crawford
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric Monfroy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Víctor Bustos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Urban and Territorial Systems, University of Basilicata, 10, Viale dell’Ateneo Lucano, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy

    Osvaldo Gervasi

  3. Department of Cyber Security Science, Federal University of Technology, Gidan Kwano Campus, Minna, Nigeria

    Sanjay Misra

  4. Faculty of Engineering, Department of Electronics Engineering and Telecommunications, State University of Rio de Janeiro, Rua Sao Francisco Xavier, 524, 50. andar, sala 5145-F, Maracana, 20.550-013, Rio de Janeiro, RJ, Brazil

    Nadia Nedjah

  5. Department of Production and Systems, University of Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Soto, R., Crawford, B., Monfroy, E., Bustos, V. (2012). Using Autonomous Search for Generating Good Enumeration Strategy Blends in Constraint Programming. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31137-6_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31137-6_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31136-9

  • Online ISBN: 978-3-642-31137-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics