A Memetic Algorithm with Bucket Elimination for the Still Life Problem
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.
KeywordsTabu Search Constraint Programming Constraint Satisfaction Problem Memetic Algorithm Soft Constraint
Unable to display preview. Download preview PDF.
- 5.Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: CP-AI-OR, pp. 77–91 (2002)Google Scholar