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

A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems

Department of Technology and Maritime Innovation, Buskerud and Vestfold University College, P.O. Box 4, 3199 Borre, Norway

Received 7 October 2014; Revised 5 March 2015; Accepted 1 April 2015

Academic Editor: Jianming Shi

Copyright © 2015 N. Bouhmala. 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. M. Dincbas and H. Simonis, “APACHE—a constraint based, automated stand allocation system,” in Proceedings of the Advanced Software Technology in Air Transport (ASTAIR '91), pp. 267–282, Royal Aeronautical Society, London, UK, 1991.
  2. J. Bellone, A. Chamard, and C. Pradelles, “PLANE -an evolutive planning system for aircraft production,” in Proceedings of the 1st International Conference on Practical Application of Prolog, 1992.
  3. H. Simonis and P. Charlier, “COBRA—a system for train crew Scheduling,” in Proceedings of the Workshop on Constraint Programming and Large Scale Combinatorial Optimization (DIMACS '98), Rutgers University, New Brunswick, NJ, USA, September 1998.
  4. G. Baues, P. Kay, and P. Charlier, “Constraint based resource allocation for airline crew management,” in PRoceedings of the ATTIS, Paris, France, April 1994.
  5. R. Amadini, I. Sefrioui, J. Mauro, and M. Gabbrielli, “A constraint-based model for fast post-disaster emergency vehicle routing,” International Jorunal of Interactive Multimedia and Artificial Intelligence, vol. 2, no. 4, pp. 67–75, 2013. View at Publisher · View at Google Scholar
  6. K. Kinoshita, K. Iizuka, and Y. Iizuka, “Effective disaster evacuation by solving the distributed constraint optimization problem,” in Proceedings of the 2nd IIAI International Conference on Advanced Applied Informatics (IIAIAAI '13), pp. 399–400, Los Alamitos, Calif, USA, September 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. F. Rossi, P. V. Beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), Elsevier Science, New York, NY, USA, 2006.
  8. R. Dechter and J. Pearl, “Tree clustering for constraint networks,” Artificial Intelligence, vol. 38, no. 3, pp. 353–366, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  9. F. Rossi, C. Petri, and V. Dhar, “On the equivalence of constraint satisfaction problems,” in Proceedings of the European Conference on Artificial Intelligence (ECAI '90), pp. 550–556, 1990.
  10. A. K. Mackworth, “Consistency in networks of relations,” Artificial Intelligence, vol. 8, no. 1, pp. 99–118, 1977. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Dechter and D. Frost, “Backjump-based backtracking for constraint satisfaction problems,” Artificial Intelligence, vol. 136, no. 2, pp. 147–188, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. N. Jussien, G. Rochart, and X. Lorca, “Choco: an open source java constraint programming Library,” in Proceedings of the Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP '08), pp. 1–10, Paris, France, June 2008.
  13. S. Merchez, C. Lecoutre, and F. Boussemart, “AbsCon: a prototype to solve CSPs with abstraction,” in Principles and Practice of Constraint Programming—CP 2001, vol. 2239 of Lecture Notes in Computer Science, pp. 730–744, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  14. J.-C. Régin, “AC-*: a configurable, generic and adaptive arc consistency algorithm,” in Principles and Practice of Constraint Programming—CP 2005, vol. 3709 of Lecture Notes in Computer Science, pp. 505–519, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  15. D. Sabin and E. C. Freuder, “Contradicting conventional wisdom in constraint satisfaction,” in Proceedings of the 11th European Conference on Artificial Intelligence (ECAI '94), pp. 125–129, Amsterdam, The Netherlands, August 1994.
  16. N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, “Compiling finite linear CSP into SAT,” Constraints, vol. 14, no. 2, pp. 254–272, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, “Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems,” Artificial Intelligence, vol. 58, no. 1–3, pp. 161–205, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. P. Morris, “The breakout method for escaping from local minima,” in Proceedings of the 11th National Conference on Artificial Intelligence (AAAI '93), pp. 40–45, 1993.
  19. R. J. Wallace and E. C. Freuder, “Heuristic methods for over-constrained constraint satisfaction problems,” in Over-Constrained Systems, vol. 1106 of Lecture Notes in Computer Science, pp. 207–216, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  20. P. Galinier and J.-K. Hao, “Tabu search for maximal constraint satisfaction problems,” in Principles and Practice of Constraint Programming-CP97, vol. 1330 of Lecture Notes in Computer Science, pp. 196–208, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  21. T. Stützle, Local search algorithms for combinatorial problems—analysis, improvements, and new applications [Ph.D. thesis], TU Darmstadt, FB Informatik, Darmstadt, Germany, 1998.
  22. N. Bacanin and M. Tuba, “Artificial bee colony (ABC) algorithm for constrained optimization improved with genetic operators,” Studies in Informatics and Control, vol. 21, no. 2, pp. 137–146, 2012. View at Google Scholar · View at Scopus
  23. M. R. Bonyadi, X. Li, and Z. Michalewicz, “A hybrid particle swarm with velocity mutation for constraint optimization problems,” in Proceedings of the 15th Genetic and Evolutionary Computation Conference (GECCO '13), pp. 1–8, ACM, New York, NY, USA, July 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. D. Curran, E. Freuder, and T. Jansen, “Incremental evolution of local search heuristics,” in Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference (GECCO '10), pp. 981–982, ACM, New York, NY, USA, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Voß, “Meta-heuristics: state of the art,” in Local Search for Planning and Scheduling, vol. 2148 of Lecture Notes in Computer Science, pp. 1–23, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  26. Y. Zhou, G. Zhou, and J. Zhang, “A hybrid glowworm swarm optimization algorithm for constrained engineering design problems,” Applied Mathematics and Information Sciences, vol. 7, no. 1, pp. 379–388, 2013. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Davenport, E. Tsang, C. J. Wang, and K. Zhu, “Genet: a connectionist architecture for solving constraint satisfaction problems by iterative improvement,” in Proceedings of the 12th National Conference on Artificial Intelligence (AAAI '94), pp. 325–330, Seattle, Wash, USA, August 1994.
  28. C. Voudouris and E. P. K. Tsang, “Guided local search,” in Handbook of Metaheuristics, vol. 57 of International Series in Operation Research and Management Science, pp. 185–218, Kluwer Academic Publishers, Boston, Mass, USA, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  29. Y. Shang and B. W. Wah, “A discrete Lagrangian-based global-search method for solving satisfiability problems,” Journal of Global Optimization, vol. 12, no. 1, pp. 61–99, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  30. D. Schuurmans, F. Southey, and R. C. Holte, “The exponentiated subgradient algorithm for heuristic Boolean programming,” in Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI '01), pp. 334–341, Morgan Kaufmann, San Francisco, Calif, USA, August 2001. View at Scopus
  31. F. Hutter, D. A. D. Tompkins, and H. H. Hoos, “Scaling and probabilistic smoothing: efficient dynamic local search for SAT,” in Principles and Practice of Constraint Programming—CP 2002, vol. 2470 of Lecture Notes in Computer Science, pp. 233–248, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  32. D. A. H. Amante and H. T. Marin, “Adaptive penalty weights when solving congress timetabling,” in Advances in Artificial Intelligence—IBERAMIA 2004, vol. 3315 of Lecture Notes in Computer Science, pp. 144–153, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  33. M. R. Karim, “A new approach to constraint weight learning for variable ordering in CSPs,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '14), pp. 2716–2723, Beijing, China, July 2014.
  34. R. Shalom, M. Avigal, and R. Unger, “A conflict based SAW method for constraint satisfaction problems,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '09), pp. 373–380, IEEE, Trondheim, Norway, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  35. W. Pullan, F. Mascia, and M. Brunato, “Cooperating local search for the maximum clique problem,” Journal of Heuristics, vol. 17, no. 2, pp. 181–199, 2011. View at Publisher · View at Google Scholar · View at Scopus
  36. S. Fang, Y. Chu, K. Qiao, X. Feng, and K. Xu, “Combining edge weight and vertex weight for minimum vertex cover problem,” in Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings, vol. 8497 of Lecture Notes in Computer Science, pp. 71–81, Springer, 2014. View at Publisher · View at Google Scholar
  37. 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, August 2004.
  38. M.-J. Huguet, P. Lopez, and W. Karoui, “Weight-based heuristics for constraint satisfaction and combinatorial optimization problems,” Journal of Mathematical Modelling and Algorithms, vol. 11, no. 2, pp. 193–215, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  39. M. Mouhoub and B. Jafari, “Heuristic techniques for variable and value ordering in CSPs,” in Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (GECCO '11), pp. 457–464, ACM, Dublin, Ireland, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  40. A. Alexiadis and J. Refanidis, “Post-optimizing individual activity plans through local search,” in Proceedings of the 8th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS '13), pp. 7–15, 2013.
  41. D. Joslin and D. P. Clements, “Squeaky wheel optimization,” Journal of Artificial Intelligence Research, vol. 10, pp. 353–373, 1999. View at Google Scholar
  42. H.-J. Lee, S.-J. Cha, Y.-H. Yu, and G.-S. Jo, “Large neighborhood search using constraint satisfaction techniques in vehicle routing problem,” in Advances in Artificial Intelligence, vol. 5549 of Lecture Notes in Computer Science, pp. 229–232, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  43. W. S. Havens and B. N. Dilkina, “A hybrid schema for systematic local search,” in Advances in Artificial Intelligence: 17th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2004, London, Ontario, Canada, May 17–19, 2004. Proceedings, vol. 3060 of Lecture Notes in Computer Science, pp. 248–260, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  44. N. Jussien and O. Lhomme, “Local search with constraint propagation and conflict-based heuristics,” Artificial Intelligence, vol. 139, no. 1, pp. 21–45, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  45. P. V. Hentenryck and L. Michel, Constraint-Based Local Search, MIT Press, 2005.
  46. B. W. Kerninghan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Publisher · View at Google Scholar
  47. S. Lin and B. W. Kerninghan, “An effective heuristic for the traveling salesman problem,” Operations Research, vol. 21, no. 2, pp. 498–516, 1973. View at Google Scholar
  48. U. Grenander, Pattern Analysis, Springer, Berlin, Germany, 1978. View at MathSciNet
  49. J. Bentley, “Programming pearls: perspective on performance,” Communications of the ACM, vol. 27, no. 11, pp. 1087–1092, 1984. View at Publisher · View at Google Scholar
  50. C. Lecoutre, 2010, https://www.cril.univ-artois.fr/~lecoutre/benchmarks.html.
  51. K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, “Random constraint satisfaction: easy generation of hard (satisfiable) instances,” Artificial Intelligence, vol. 171, no. 8-9, pp. 514–534, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  52. K. Xu and W. Li, “Exact phase Transition in constraint satisfaction problems,” Journal of Artificial Intelligence Research, vol. 12, pp. 93–103, 2000. View at Google Scholar
  53. C. Solnon, Ant Colony Optimization and Constraint Programming, Wiley-ISTE, 2006.