A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

0.00 Avg rating0 Votes
Article ID: iaor20071853
Country: United Kingdom
Volume: 12
Issue: 3
Start Page Number: 325
End Page Number: 338
Publication Date: May 2005
Journal: International Transactions in Operational Research
Authors: ,
Keywords: graphs, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.