Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2016, Article ID 7349070, 15 pages
http://dx.doi.org/10.1155/2016/7349070
Research Article

Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems

National School of Engineering and Sciences, Tecnológico de Monterrey, Avenida Eugenio Garza Sada 2501 Sur, Colonia Tecnológico, 64849 Monterrey, NL, Mexico

Received 29 September 2015; Revised 16 December 2015; Accepted 27 December 2015

Academic Editor: Paul C. Kainen

Copyright © 2016 Jorge Humberto Moreno-Scott 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. S. L. Epstein, E. C. Freuder, R. 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–542, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  2. E. O'Mahony, E. Hebrard, A. Holland, C. Nugent, and B. O'Sullivan, “Using case-based reasoning in an algorithm portfolio for constraint solving,” in Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, Cork, Ireland, August 2008.
  3. S. Petrovic and R. Qu, “Case-based reasoning as a heuristic selector in a hyper-heuristic for course timetabling problems,” in Proceedings of the 6th International Conference on Knowledge-Based Intelligent Information Engineering Systems and Applied Technologies (KES '02), vol. 82, pp. 336–340, September 2002.
  4. B. Crawford, R. Soto, C. Castro, and E. Monfroy, “A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction,” in New Challenges on Bioinspired Applications, vol. 6687 of Lecture Notes in Computer Science, pp. 295–304, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  5. J. C. Ortiz-Bayliss, H. Terashima-Marín, and S. E. Conant-Pablos, “Learning vector quantization for variable ordering in constraint satisfaction problems,” Pattern Recognition Letters, vol. 34, no. 4, pp. 423–432, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. 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: 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
  7. Y. Malitsky, “Evolving instance-specific algorithm configuration,” in Instance-Specific Algorithm Configuration, pp. 93–105, Springer, Basel, Switzerland, 2014. View at Publisher · View at Google Scholar
  8. P. Hell and J. Nešetřil, “Colouring, constraint satisfaction, and complexity,” Computer Science Review, vol. 2, no. 3, pp. 143–163, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. N. Dunkin and S. Allen, “Frequency assignment problems: representations and solutions,” Tech. Rep. CSD-TR-97-14, University of London, 1997. View at Google Scholar
  10. J. A. Berlier and J. M. McCollum, “A constraint satisfaction algorithm for microcontroller selection and pin assignment,” in Proceedings of the IEEE SoutheastCon, pp. 348–351, IEEE, Concord, NC, USA, March 2010. View at Publisher · View at Google Scholar
  11. J. R. Bitner and E. M. Reingold, “Backtrack programming techniques,” Communications of the ACM, vol. 18, no. 11, pp. 651–656, 1975. View at Publisher · View at Google Scholar · View at Scopus
  12. N. Jussien and O. Lhomme, “Local search with constraint propagation and conflict-based heuristics,” in Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, pp. 169–174, AAAI Press, MIT Press, Austin, Tex, USA, July-August 2000.
  13. J. R. Rice, “The algorithm selection problem,” Advances in Computers, vol. 15, pp. 65–118, 1976. View at Google Scholar
  14. T. Stützle and S. Fernandes, “New benchmark instances for the qap and the experimental analysis of algorithms,” in Evolutionary Computation in Combinatorial Optimization, J. Gottlieb and G. Raidl, Eds., vol. 3004 of Lecture Notes in Computer Science, pp. 199–209, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  15. K. A. Smith-Miles, “Towards insightful algorithm selection for optimisation using meta-learning concepts,” in Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN '08), pp. 4118–4124, IEEE, Hong Kong, June 2008. View at Publisher · View at Google Scholar
  16. K. A. Smith-Miles, R. J. James, J. W. Giffin, and Y. Tu, “A knowledge discovery approach to understanding relationships between scheduling problem structure and heuristic performance,” in Learning and Intelligent Optimization, T. Stützle, Ed., vol. 5851 of Lecture Notes in Computer Science, pp. 89–103, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  17. K. Smith-Miles, D. Baatar, B. Wreford, and R. Lewis, “Towards objective measures of algorithm performance across instance space,” Computers and Operations Research, vol. 45, pp. 12–24, 2014. View at Publisher · View at Google Scholar · View at Scopus
  18. B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, “Algorithm selection based on exploratory landscape analysis and cost-sensitive learning,” in Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12), pp. 313–320, ACM, Philadelphia, Pa, USA, July 2012. View at Publisher · View at Google Scholar
  19. E. López-Camacho, H. Terashima-Marín, G. Ochoa, and S. E. Conant-Pablos, “Understanding the structure of bin packing problems through principal component analysis,” International Journal of Production Economics, vol. 145, no. 2, pp. 488–499, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. E. Tsang and A. Kwan, “Mapping constraint satisfaction problems to algorithms and heuristics,” Tech. Rep. CSM-198, Department of Computer Sciences, University of Essex, 1993. View at Google Scholar
  21. J. C. Ortiz-Bayliss, H. Terashima-Marin, P. Ross, J. I. Fuentes-Rosado, and M. Valenzuela-Rend, “A neuro-evolutionary approach to produce general hyper-heuristics for the dynamic variable ordering in hard binary constraint satisfaction problems,” in Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO '09), pp. 1811–1812, Montreal, Canada, July 2009. View at Publisher · View at Google Scholar
  22. J. H. Moreno-Scott, J. C. Ortiz-Bayliss, H. Terashima-Marín, and S. E. Conant-Pablos, “Challenging heuristics: evolving binary constraint satisfaction problems,” in Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12), pp. 409–416, ACM, New York, NY, USA, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  23. K. Smith-Miles, J. van Hemert, and X. Y. Lim, “Understanding TSP difficulty by learning from evolved instances,” in Learning and Intelligent Optimization, C. Blum and R. Battiti, Eds., vol. 6073 of Lecture Notes in Computer Science, pp. 266–280, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  24. K. Smith-Miles and J. van Hemert, “Discovering the suitability of optimisation algorithms by learning from evolved instances,” Annals of Mathematics and Artificial Intelligence, vol. 61, no. 2, pp. 87–104, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  25. J. I. van Hemert, “Evolving binary constraint satisfaction problem instances that are difficult to solve,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '03), vol. 2, pp. 1267–1273, IEEE, December 2003. View at Publisher · View at Google Scholar · View at Scopus
  26. J. I. Van Hemert, “Evolving combinatorial problem instances that are difficult to solve,” Evolutionary Computation, vol. 14, no. 4, pp. 433–462, 2006. View at Publisher · View at Google Scholar · View at Scopus
  27. F. Boussemart, F. Hemery, and C. Lecoutre, “Revision ordering heuristics for the constraint satisfaction problem,” in Proceedings of the 1st International Workshop on Constraint Propagation and Implementation (CPAI '04), pp. 9–43, Toronto, Canada, September 2004.
  28. I. P. Gent, E. MacIntyre, P. Prosser, B. M. Smith, and T. Walsh, “An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem,” in Principles and Practice of Constraint Programming—CP96: Second International Conference, CP96 Cambridge, MA, USA, August 19–22, 1996 Proceedings, vol. 1118 of Lecture Notes in Computer Science, pp. 179–193, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  29. R. J. Wallace, “Analysis of heuristic synergies,” in Recent Advances in Constraints, B. Hnich, M. Carlsson, F. Fages, and F. Rossi, Eds., vol. 3978 of Lecture Notes in Computer Science, pp. 73–87, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  30. R. M. Haralick and G. L. Elliott, “Increasing tree search efficiency for constraint satisfaction problems,” in Proceedings of the 6th International Joint Conference on Artificial Intelligence, vol. 1, pp. 356–364, Morgan Kaufmann, San Francisco, Calif, USA, 1979.
  31. R. Dechter and I. Meiri, “Experimental evaluation of preprocessing algorithms for constraint satisfaction problems,” Artificial Intelligence, vol. 68, no. 2, pp. 211–241, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. D. Brélaz, “New methods to color the vertices of a graph,” Communications of the ACM, vol. 22, no. 4, pp. 251–256, 1979. View at Publisher · View at Google Scholar
  33. H. Terashima-Marín, J. C. Ortiz-Bayliss, P. Ross, and M. Valenzuela-Rendón, “Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems,” in Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO '08), pp. 571–578, ACM, Atlanta, Ga, USA, July 2008. View at Publisher · View at Google Scholar
  34. J. G. Gaschnig, “A general backtrack algorithm that eliminates most redundant tests,” in Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI '77), vol. 1, p. 457, Morgan Kaufmann, Cambridge, Mass, USA, August 1977.
  35. E. C. Freuder, “Synthesizing constraint expressions,” Communications of the ACM, vol. 21, no. 11, pp. 958–966, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. D. Achlioptas, C. Gomes, H. Kautz, and B. Selman, “Generating satisfiable problem instances,” in Proceedings of the 17th National Conference on Artificial Intelligence (AAAI '00), pp. 256–301, Austin, Tex, USA, July-August 2000.
  37. J. Culberson, “Hidden solutions, tell-tales, heuristics and anti-heuristics,” in Proceedings of the Workshop on Empirical Methods in Artificial Intelligence (IJCAI '01), H. Hoos and T. Stuëtzle, Eds., pp. 9–14, 2001.
  38. I. Rish and D. Frost, “Statistical analysis of backtracking on inconsistent CSPs,” in Principles and Practice of Constraint Programming—CP97, G. Smolka, Ed., vol. 1330 of Lecture Notes in Computer Science, pp. 150–162, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  39. B. M. Smith, “Locating the phase transition in binary constraint satisfaction problems,” Artificial Intelligence, vol. 81, no. 1-2, pp. 155–181, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. D. Achlioptas, M. S. O. Molloy, L. M. Kirousis, Y. C. Stamatiou, E. Kranakis, and D. Krizanc, “Random constraint satisfaction: a more accurate picture,” Constraints, vol. 6, no. 4, pp. 329–344, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. E. MacIntyre, P. Prosser, B. M. Smith, and E. MacIntyre, “Random constraint satisfaction: theory meets practice,” in Principles and Practice of Constraint Programming—CP98: 4th International Conference, CP98 Pisa, Italy, October 26–30, 1998 Proceedings, vol. 1520 of Lecture Notes in Computer Science, pp. 325–339, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  42. K. Xu and W. Li, “Many hard examples in exact phase transitions,” Theoretical Computer Science, vol. 355, no. 3, pp. 291–302, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  43. P. Prosser, “Hybrid algorithms for the constraint satisfaction problem,” Computational Intelligence, vol. 9, no. 3, pp. 268–299, 1993. View at Publisher · View at Google Scholar
  44. B. M. Smith, “Constructing an asymptotic phase transition in random binary constraint satisfaction problems,” Theoretical Computer Science, vol. 265, no. 1-2, pp. 265–283, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  45. Y. Fan and J. Shen, “On the phase transitions of random k-constraint satisfaction problems,” Artificial Intelligence, vol. 175, no. 3-4, pp. 914–927, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. C. Lecoutre, F. Boussemart, and F. Hemery, “Backjump-based techniques versus conflict-directed heuristics,” in Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '04), pp. 549–557, Boca Raton, Fla, USA, November 2004. View at Publisher · View at Google Scholar · View at Scopus
  47. L. Michel and P. Van Hentenryck, “Activity-based search for black-box constraint programming solvers,” in Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, N. Beldiceanu, N. Jussien, and É. Pinson, Eds., vol. 7298 of Lecture Notes in Computer Science, pp. 228–243, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  48. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, “Boosting systematic search by weighting constraints,” in Proceedings of the European Conference on Artificial Intelligence (ECAI '04), pp. 146–150, IOS Press, 2004.