A multi-level memetic/exact hybrid algorithm for the still life problem

Authors:
José E. Gallardo;Carlos Cotta;Antonio J. Fernández
Affiliations:
Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Málaga, Spain
Venue:
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Year:
2006

Citing 9
Cited 1

Tree clustering for constraint networks (research note)

Artificial Intelligence
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Genetic algorithms with multi-parent recombination

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A Dual Graph Translation of a Problem in 'Life'

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Mini-buckets: a general scheme for generating approximations in automated reasoning

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study

Journal of Artificial Intelligence Research
A memetic algorithm with bucket elimination for the still life problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.