The preservation of favored building blocks in the struggle for fitness: the puzzle algorithm

Authors:
A. Zaritsky;M. Sipper
Affiliations:
Dept. of Comput. Sci., Ben-Gurion Univ., Beer-Sheva, Israel;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2004

Citing 0
Cited 3

The greedy algorithm for shortest superstrings

Information Processing Letters
The greedy algorithm for shortest superstrings

Information Processing Letters
A new adaptive crossover operator for the preservation of useful schemata

ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The shortest common superstring (SCS) problem, known to be NP-complete, seeks the shortest string that contains all strings from a given set. In this paper, we present a novel coevolutionary algorithm-the Puzzle Algorithm-where a population of building blocks coevolves alongside a population of solutions. We show experimentally that our novel algorithm outperforms a standard genetic algorithm (GA) and a benchmark greedy algorithm on instances of the SCS problem inspired by deoxyribonucleic acid (DNA) sequencing. We next compare our previously presented cooperative coevolutionary algorithm with the Co-Puzzle Algorithm-the puzzle algorithm coupled with cooperative coevolution-showing that the latter proves to be top gun. Finally, we discuss the benefits of using our puzzle approach in the general field of evolutionary algorithms.