A memetic algorithm with bucket elimination 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:
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2006

Citing 5
Cited 2

Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Semiring-based constraint satisfaction and optimization

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

Artificial Intelligence
A Dual Graph Translation of a Problem in 'Life'

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study

Journal of Artificial Intelligence Research

Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms

Journal of Artificial Intelligence Research
A multi-level memetic/exact hybrid algorithm for the still life problem

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of BE with evolutionary algorithms endowed with tabu search. The resulting memetic algorithm (MA) uses BE as a mechanism for recombining solutions, providing the best possible child from the parental set. This MA is applied to the maximum density still life problem. Experimental tests indicate that the MA provides optimal or near-optimal results at an acceptable computational cost.