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.

Bibliographic Details

Main Authors:	Xuan Liu, Hongmei He, Ondrej Sykora
Format:	Default Text
Published:	2005
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/2387
Tags:	Add Tag No Tags, Be the first to tag this record!