A Memetic Algorithm with Bucket Elimination for the Still Life Problem

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.

• Type: Conference
• Year: 2006
• Where: EVOW
• Authors: José E. Gallardo, Carlos Cotta, Antonio J. Fernández
• Keywords: Artificial Intelligence, Bucket Elimination, Constraint Satisfaction Problems, EVOW 2006, Variable Elimination