Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 580785, 12 pages
http://dx.doi.org/10.1155/2015/580785
Research Article

Top- Based Adaptive Enumeration in Constraint Programming

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad Autónoma de Chile, 7500138 Santiago, Chile
3Universidad Central de Chile, 8370178 Santiago, Chile
4Universidad Finis Terrae, 7501015 Santiago, Chile
5Facultad de Ingeniería y Tecnología, Universidad San Sebastián, 8420524 Santiago, Chile
6CNRS, LINA, University of Nantes, 44322 Nantes, France
7Universidad de Valparaíso, 2362735 Valparaíso, Chile
8Universidad Técnica Federico Santa María, 2390123 Valparaíso, Chile
9Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

Received 23 October 2014; Accepted 3 February 2015

Academic Editor: Youqing Wang

Copyright © 2015 Ricardo Soto et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J.-P. Métivier, P. Boizumault, and S. Loudni, “Solving nurse rostering problems using soft global constraints,” in Principles and Practice of Constraint Programming—CP 2009: Proceedings of the 15th International Conference, CP 2009 Lisbon, Portugal, September 20–24, 2009, vol. 5732 of Lecture Notes in Computer Science, pp. 73–87, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  2. P. Baptiste and C. L. Pape, “Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems,” in Principles and Practice of Constraint Programming-CP97: Third International Conference, CP97 Linz, Austria, October 29–November 1, 1997 Proceedings, vol. 1330 of Lecture Notes in Computer Science, pp. 375–389, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  3. R. Soto, H. Kjellerstrand, O. Durán, B. Crawford, E. Monfroy, and F. Paredes, “Cell formation in group technology using constraint programming and Boolean satisfiability,” Expert Systems with Applications, vol. 39, no. 13, pp. 11423–11427, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Chenouard, L. Granvilliers, and P. Sebastian, “Search heuristics for constraint-aided embodiment design,” Artificial Intelligence for Engineering Design, Analysis and Manufacturing, vol. 23, no. 2, pp. 175–195, 2009. View at Publisher · View at Google Scholar
  5. P. Barahona and L. Krippahl, “Constraint programming in structural bioinformatics,” Constraints, vol. 13, no. 1-2, pp. 3–20, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. C. Castro, E. Monfroy, C. Figueroa, and R. Meneses, “An approach for dynamic split strategies in constraint solving,” in Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MI-CAI '05), vol. 3789 of Lecture Notes in Computer Science, pp. 162–174, Springer, 2005. View at Google Scholar
  7. B. Crawford, R. Soto, C. Castro, and E. Monfroy, “A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction,” in Proceedings of the 4th International Work-Conference on the Interplay between Natural and Artificial Computation (IWINAC '11), vol. 6687 of Lecture Notes in Computer Science, pp. 295–304, Springer, 2011. View at Publisher · View at Google Scholar
  8. E. K. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg, “Hyper-heuristics: an emerging direction in modern search technology,” in Handbook of Metaheuristics, vol. 57 of International Series in Operations Research & Management Science, pp. 457–474, Springer, New York, NY, USA, 2003. View at Publisher · View at Google Scholar
  9. P. Ross, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Springer, Berlin, Germany, 2005.
  10. Y. Hamadi, E. Monfroy, and F. Saubion, Autonomous Search, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  11. R. Soto, B. Crawford, E. Monfroy, and V. Bustos, “Using autonomous search for generating good enumeration strategy blends in constraint programming,” in Computational Science and Its Applications—ICCSA 2012: Proceedings of the 12th International Conference, Salvador de Bahia, Brazil, June 18-21, 2012, Proceedings, Part III, vol. 7335 of Lecture Notes in Computer Science, pp. 607–617, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  12. B. Crawford, C. Castro, E. Monfroy, R. Soto, W. Palma, and F. Paredes, “Dynamic selection of enumeration strategies for solving constraint satisfaction problems,” Romanian Journal of Information Science and Technology, vol. 15, no. 2, pp. 106–128, 2012. View at Google Scholar · View at Scopus
  13. B. Crawford, R. Soto, E. Monfroy, W. Palma, C. Castro, and F. Paredes, “Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization,” Expert Systems with Applications, vol. 40, no. 5, pp. 1690–1695, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. S. L. Epstein, E. C. Freuder, R. J. Wallace, A. Morozov, and B. Samuels, “The adaptive constraint engine,” in Principles and Practice of Constraint Programming—CP 2002: 8th International Conference, CP 2002 Ithaca, NY, USA, September 9–13, 2002 Proceedings, vol. 2470 of Lecture Notes in Computer Science, pp. 525–540, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  15. S. Epstein and S. Petrovic, “Learning to solve constraint problems,” in Proceedings of the Workshop on Planning and Learning (ICAPS '07), 2007.
  16. Y. Xu, D. Stern, and H. Samulowitz, “Learning adaptation to solve constraint satisfaction problems,” in Proceedings of the 3rd International Conference on Learning and Intelligent Optimization (LION '09), pp. 507–523, 2009.
  17. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, “Boosting systematic search by weighting constraints,” in Proceedings of the 16th European Conference on Artificial Intelligence (ECAI '04), pp. 146–150, IOS Press, 2004. View at Google Scholar
  18. D. Grimes and R. J. Wallace, “Learning to identify global bottlenecks in constraint satisfaction search,” in Proceedings of the 20th International Florida Artificial Intelligence Research Society Conference (FLAIRS '07), pp. 592–597, AAAI Press, May 2007. View at Scopus
  19. R. J. Wallace and D. Grimes, “Experimental studies of variable selection strategies based on constraint weights,” Journal of Algorithms, vol. 63, no. 1–3, pp. 114–129, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. R. Barták and H. Rudová, “Limited assignments: a new cutoff strategy for incomplete depth-first search,” in Proceedings of the ACM Symposium on Applied Computing (SAC '05), pp. 388–392, 2005. View at Publisher · View at Google Scholar
  21. E. Monfroy, C. Castro, B. Crawford, R. Soto, F. Paredes, and C. Figueroa, “A reactive and hybrid constraint solver,” Journal of Experimental and Theoretical Artificial Intelligence, vol. 25, no. 1, pp. 1–22, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Han, “Deterministic sorting in O(nloglogn) time and linear space,” Journal of Algorithms, vol. 50, no. 1, pp. 96–105, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. M. Thorup, “Randomized sorting in O(nloglogn) time and linear space using addition, shift, and bit-wise Boolean operations,” Journal of Algorithms, vol. 42, no. 2, pp. 205–230, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. I. F. Ilyas, G. Beskales, and M. A. Soliman, “A survey of top-k query processing techniques in relational database systems,” ACM Computing Surveys, vol. 40, no. 4, article 11, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. B. Crawford, R. Soto, C. Castro, E. Monfroy, and F. Paredes, “An extensible autonomous search framework for constraint programming,” International Journal of Physical Sciences, vol. 6, no. 14, pp. 3369–3376, 2011. View at Google Scholar · View at Scopus
  26. T. Balafoutis and K. Stergiou, “Evaluating and improving modern variable and revision ordering strategies in CSPs,” Fundamenta Informaticae, vol. 102, no. 3-4, pp. 229–261, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. P. van Beek, “Backtracking search algorithms,” in Handbook of Constraint Programming, chapter 4, pp. 85–134, Elsevier, 2006. View at Google Scholar
  28. I. P. Gent, E. MacIntyre, P. Presser, B. M. Smith, and T. Walsh, “An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem,” in Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP '96), vol. 1118 of Lecture Notes in Computer Science, pp. 179–193, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar