A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure |
| |
Authors: | Celso C Ribeiro Dalessandro S Vianna |
| |
Affiliation: | Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900, Brazil [C.C. Ribeiro];[D.S. Vianna] |
| |
Abstract: | A phylogeny is a tree that relates taxonomic units, based on their similarity over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. We propose a new neighborhood structure for the phylogeny problem. A greedy randomized adaptive search procedure heuristic based on this neighborhood structure and using variable neighborhood descent for local search is described. Computational results on randomly generated and benchmark instances are reported, showing that the new heuristic is quite robust and outperforms the other algorithms in the literature in terms of solution quality and time‐to‐target value. |
| |
Keywords: | phylogeny problem phylogenetic trees evolutionary trees GRASP local search VND heuristics |
|