Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

• Type: Conference
• Year: 2005
• Where: ADMA
• Authors: Xuan Liu, Hongmei He, Ondrej Sýkora
• Keywords: ADMA 2005, Closest String Problem, Data Mining, Genetic Algorithm, Parallel Versions