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

13 years 10 months ago

Download www.lboro.ac.uk

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.

Xuan Liu, Hongmei He, Ondrej Sýkora

Real-time Traffic

ADMA 2005 | Closest String Problem | Data Mining | Genetic Algorithm | Parallel Versions |

claim paper

» Adaptive temperature schedule determined by genetic algorithm for parallel simulated annea...

» Metaheuristics for Circuit Partitioning in Parallel Test Generation

» Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows

» Multiniche crowding in the development of parallel genetic simulated annealing

» A Parallel Genetic Algorithm for Physical Mapping of Chromosomes

» Mining Top k Ranked Webpages Using Simulated Annealing and Genetic Algorithms

» GenAnneal Genetically modified Simulated Annealing

» Parallel Simulated Annealing Algorithm for Graph Coloring Problem

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	ADMA
Authors	Xuan Liu, Hongmei He, Ondrej Sýkora

Comments (0)

Sciweavers

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

ADMA 2005 | Closest String Problem | Data Mining | Genetic Algorithm | Parallel Versions |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers