A Multi-level Memetic/Exact Hybrid Algorithm for the Still Life Problem

  • José E. Gallardo
  • Carlos Cotta
  • Antonio J. Fernández
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4193)


Bucket elimination (BE) is an exact technique based on variable elimination. It has been recently used with encouraging results as a mechanism for recombining solutions in a memetic algorithm (MA) for the still life problem, a hard constraint optimization problem based on Conway’s game of life. This paper studies expanded multi-level models in which this exact/metaheuristic hybrid is further hybridized with branch-and-bound techniques. A novel variable clustering based recombination operator is also explored, with the aim of reducing the inherent time complexity of BE. Multi-parent recombination issues are analyzed as well. The obtained results are of higher quality than any previous metaheuristic approach, with large instances being solved to optimality.


Hybrid Algorithm Constraint Programming Constraint Satisfaction Problem Memetic Algorithm Variable Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gardner, M.: The fantastic combinations of John Conway’s new solitaire game. Scientific American 223, 120–123 (1970)CrossRefGoogle Scholar
  2. 2.
    Gardner, M.: On cellular automata, self-reproduction, the garden of Eden and the game of “life”. Scientific American 224, 112–117 (1971)CrossRefGoogle Scholar
  3. 3.
    Gardner, M.: Wheels, Life, and Other Mathematical Amusements. W.H. Freeman, New York (1983)MATHGoogle Scholar
  4. 4.
    Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: CP-AI-OR, pp. 77–91 (2002)Google Scholar
  5. 5.
    Smith, B.M.: A dual graph translation of a problem in ‘life’. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 402–414. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Larrosa, J., Morancho, E., Niso, D.: 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 (2005)MATHGoogle Scholar
  7. 7.
    Cheng, K., Yap, R.: Ad-hoc global constraints for life. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 182–195. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Gallardo, J.E., Cotta, C., Fernández, A.J.: A memetic algorithm with bucket elimination for the still life problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 73–85. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Eiben, A., Raue, P.E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 78–87. Springer, Heidelberg (1994)Google Scholar
  10. 10.
    Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44, 201–236 (1997)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Radcliffe, N.: The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10, 339–384 (1994)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Larrosa, J., Morancho, E.: Solving ‘still life’ with soft constraints and bucket elimination. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 466–479. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence, 353–366 (1989)Google Scholar
  15. 15.
    Gallardo, J., Cotta, C., Fernández, A.: On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Transactions on Systems, Man and Cybernetics, part B (to appear, 2006)Google Scholar
  16. 16.
    Dechter, R.: Mini-buckets: A general scheme for generating approximations in automated reasoning. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, pp. 1297–1303. Morgan Kaufmann, San Francisco (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • José E. Gallardo
    • 1
  • Carlos Cotta
    • 1
  • Antonio J. Fernández
    • 1
  1. 1.Dept. Lenguajes y Ciencias de la Computación, ETSI InformáticaUniversity of MálagaMálagaSpain

Personalised recommendations