Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms

Journal of Artificial Intelligence Research

Volumn 35, Issue , 2009, Pages 533-555

  Gallardo, José E ^a   Cotta, Carlos ^a   Fernández, Antonio J ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; HEURISTIC METHODS;

BRANCH AND BOUND TECHNIQUES; BUCKET ELIMINATIONS; CURSE OF DIMENSIONALITY; HYBRID ALGORITHMS; LARGE-SCALE PROBLEM; MEMETIC ALGORITHMS; OPTIMAL SOLUTIONS; WEIGHTED CONSTRAINT SATISFACTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 80054704523     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.2770     Document Type: Article

References (46)

1. Ahuja, R. K., Ergun, O., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large-scale neighborhood search techniques. Discrete Appl. Math., 123(1-3), 75–102.
2. Arnborg, S. (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 2, 2–23.
3. Bäck, T. (1996). Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York NY.
4. Bäck, T., Fogel, D., & Michalewicz, Z. (1997). Handbook of Evolutionary Computation. Oxford University Press, New York NY.
5. Barr, A., & Feigenbaum, E. (1981). Handbook of Artificial Intelligence. Morhan Kaufmann, New York NY.
6. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press, New York NY.
7. Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2), 201–236.
8. Bosch, R., & Trick, M. (2002). Constraint programming and hybrid formulations for three life designs. In International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR02, pp. 77–91.
9. Cabon, B., de Givry, S., Lobjois, L., Schiex, T., & Warners, J. P. (1999). Radio link frequency assignment. Constraints, 4(1), 79–89.
10. Cheng, K. C. K., & Yap, R. H. C. (2005). Ad-hoc global constraints for life. In van Beek, P. (Ed.), Principles and Practice of Constraint Programming – CP’2005, Vol. 3709 of Lecture Notes in Computer Science, pp. 182–195, Berlin Heidelberg. Springer.
11. Cheng, K. C. K., & Yap, R. H. C. (2006). Applying ad-hoc global constraints with the case constraint to still-life. Constraints, 11, 91–114.
12. Cotta, C., & Troya, J. (2000). On the influence of the representation granularity in heuristic forma recombination. In Carroll, J., Damiani, E., Haddad, H., & Oppenheim, D. (Eds.), ACM Symposium on Applied Computing 2000, pp. 433–439. ACM Press.
13. Cotta, C., & Troya, J. (2003). Embedding branch and bound within evolutionary algorithms. Applied Intelligence, 18(2), 137–153.
14. Culberson, J. (1998). On the futility of blind search: An algorithmic view of “no free lunch”. Evolutionary Computation, 6(2), 109–128.
15. Dechter, R. (1997). Mini-buckets: A general scheme for generating approximations in automated reasoning. In 15th International Joint Conference on Artificial Intelligence, pp. 1297–1303, Nagoya, Japan.
16. Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1-2), 41–85.
17. Detcher, R., & Rish, I. (2003). Mini-buckets: A general scheme for bounded inference. Journal of the ACM, 50(2), 107–153.
18. Eiben, A., Raue, P.-E., & Ruttkay, Z. (1994). Genetic algorithms with multi-parent recombination. In Davidor, Y., Schwefel, H.-P., & Männer, R. (Eds.), Parallel Problem Solving From Nature III, Vol. 866 of Lecture Notes in Computer Science, pp. 78–87, Berlin Heidelberg. Springer.
19. Elkies, N. D. (1998). The still-life problem and its generalizations. In Engel, P., & Syta, H. (Eds.), Voronoi’s Impact on Modern Science, Book 1, pp. 228–253. Institute of Math, Kyiv.
20. Freuder, E. C., & Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58(1-3), 21–70.
21. Gallardo, J. E., Cotta, C., & Fernández, A. J. (2008). Finding still lifes with memetic/exact hybrid algorithms. CoRR, Available at http://arxiv.org/abs/0812.4170.
22. Gallardo, J., Cotta, C., & Fernández, A. (2007). On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Transactions on Systems, Man and Cybernetics, part B, 37(1), 77–83.
23. Gallardo, J. E., Cotta, C., & Fernández, A. J. (2006a). A memetic algorithm with bucket elimination for the still life problem. In Gottlieb, J., & Raidl, G. (Eds.), Evolutionary Computation in Combinatorial Optimization, Vol. 3906 of Lecture Notes in Computer Science, pp. 73–85, Berlin Heidelberg. Springer.
24. Gallardo, J. E., Cotta, C., & Fernández, A. J. (2006b). A multi-level memetic/exact hybrid algorithm for the still life problem. In Runarsson, T. P., et al. (Eds.), Parallel Problem Solving from Nature IX, Vol. 4193 of Lecture Notes in Computer Science, pp. 212–221, Berlin Heidelberg. Springer.
25. Gardner, M. (1970). The fantastic combinations of John Conway’s new solitaire game. Scientific American, 223, 120–123.
26. Gelain, M., Pini, M. S., Rossi, F., & Venable, K. B. (2007). Dealing with incomplete preferences in soft constraint problems. In Bessiere, C. (Ed.), Principles and Practice of Constraint Programming – CP 2007, Vol. 4741 of Lecture Notes in Computer Science, pp. 286–300, Berlin Heidelberg. Springer.
27. Glover, F. (1989). Tabu search – part I. ORSA Journal on Computing, 1(3), 190–206.
28. Glover, F. (1990). Tabu search – part II. ORSA Journal on Computing, 2(1), 4–32.
29. Hart, W., Krasnogor, N., & Smith, J. (2005). Recent Advances in Memetic Algorithms, Vol. 166 of Studies in Fuzziness and Soft Computing. Springer, Berlin Heidelberg.
30. Kask, K., & Detcher, R. (2001). A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129, 91–131.
31. Khemmoudj, M. O. I., & Bennaceur, H. (2007). Valid inequality based lower bounds for WCSP. In Bessiere, C. (Ed.), Principles and Practice of Constraint Programming – CP 2007, Vol. 4741 of Lecture Notes in Computer Science, pp. 394–408, Berlin Heidelberg. Springer.
32. Krasnogor, N., & Smith, J. (2005). A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5), 474–488.
33. Larrosa, J., & Morancho, E. (2003). Solving ‘still life’ with soft constraints and bucket elimination. In Principles and Practice of Constraint Programming – CP’2003, Vol. 2833 of Lecture Notes in Computer Science, pp. 466–479, Berlin Heidelberg. Springer.
34. Larrosa, J., Morancho, E., & Niso, D. (2005). On the practical use of variable elimination in constraint optimization problems: ‘still life’ as a case study. Journal of Artificial Intelligence Research, 23, 421–440.
35. Larrosa, J., & Schiex, T. (2004). Solving weighted CSP by maintaining arc consistency. Artificial Intelligence, 159(1-2), 1–26.
36. Lawler, E., & Wood, D. (1966). Branch and bounds methods: A survey. Operations Research, 4(4), 669–719.
37. Lemaître, M., Verfaillie, G., Bourreau, E., & Laburthe, F. (2001). Integrating algorithms for weighted CSP in a constraint programming framework. In International Workshop on Modelling and Solving Problems with Soft Constraints, Paphos, Cyprus.
38. Marinescu, R., & Dechter, R. (2007). Best-first and/or search for graphical models. In Twenty-Second AAAI Conference on Artificial Intelligence, pp. 1171–1176, Vancouver, Canada. AAAI Press.
39. Moscato, P., & Cotta, C. (2003). A gentle introduction to memetic algorithms. In Handbook of Metaheuristics, pp. 105–144. Kluwer Academic Press, Boston, Massachusetts, USA.
40. Moscato, P., & Cotta, C. (2007). Memetic algorithms. In González, T. (Ed.), Handbook of Approximation Algorithms and Metaheuristics, chap. 27. Chapman & Hall/CRC Press.
41. Nonobe, K., & Ibaraki, T. (2001). An improved tabu search method for the weighted constraint satisfaction problem. INFOR, 39(2), 131–151.
42. Puchinger, J., & Raidl, G. (2005). Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In Mira, J., & Álvarez, J. (Eds.), Artificial Intelligence and Knowledge Engineering Applications: a Bioinspired Approach, Vol. 3562 of Lecture Notes in Computer Science, pp. 41–53, Berlin Heidelberg. Springer.
43. Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: hard and easy problems. In 14th International Joint Conference on Artificial Intelligence, pp. 631–637, Montreal, Canada.
44. Smith, B. M. (2002). A dual graph translation of a problem in ‘life’. In Hentenryck, P. V. (Ed.), Principles and Practice of Constraint Programming - CP’2002, Vol. 2470 of Lecture Notes in Computer Science, pp. 402–414, Berlin Heidelberg. Springer.
45. Verfaillie, G., Lemaître, M., & Schiex, T. (1996). Russian doll search for solving constraint optimization problems. In Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI / IAAI 96, pp. 181–187. AAAI Press / The MIT Press.
46. Wolpert, D., & Macready, W. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82.