| Article ID: | iaor2007225 |
| Country: | United States |
| Volume: | 16 |
| Issue: | 3 |
| Start Page Number: | 232 |
| End Page Number: | 240 |
| Publication Date: | Jun 2004 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Glover Fred, Baewicz Jacek, Kasprzak Marta |
| Keywords: | heuristics: tabu search, programming: integer |
In this paper, a tabu-search algorithm enhanced by scatter search is presented. The algorithm solves the DNA sequencing problem with negative and positive errors, yielding outcomes of high quality. We compare the new method with two other metaheuristic approaches: a previous tabu-search method and a hybrid genetic algorithm, and also with an old branch-and-bound approach.