Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gardner, M.: The fantastic combinations of John Conway’s new solitaire game. Scientific American 223, 120–123 (1970)
Gardner, M.: On cellular automata, self-reproduction, the garden of Eden and the game of “life”. Scientific American 224, 112–117 (1971)
Gardner, M.: Wheels, Life, and Other Mathematical Amusements. W.H. Freeman, New York (1983)
Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: CP-AI-OR, pp. 77–91 (2002)
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)
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)
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)
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)
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)
Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44, 201–236 (1997)
Radcliffe, N.: The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10, 339–384 (1994)
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)
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence, 353–366 (1989)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gallardo, J.E., Cotta, C., Fernández, A.J. (2006). A Multi-level Memetic/Exact Hybrid Algorithm for the Still Life Problem. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_22
Download citation
DOI: https://doi.org/10.1007/11844297_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)