HYBRID HEURISTICS FOR THE PHYLOGENY PROBLEM / HEURÍSTICAS HÍBRIDAS PARA O PROBLEMA DA FILOGENIA
AUTOR(ES)
DALESSANDRO SOARES VIANNA
DATA DE PUBLICAÇÃO
2004
RESUMO
A phylogeny is a tree that relates taxonomic units, based on their similarities over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. The main goal of this work is to develop hybrid heuristics for this problem. Two strategies are proposed. The first combines the GRASP metaheuristic using a new neighborhood structure (k-SPR) proposed in this work with a VND local search procedure. The second hybrid strategy combines genetic algorithms with an innovative optimized crossover strategy which is an extension of the path-relinking intensification technique originally applied in the context of other metaheuristics such as tabu search and GRASP. Computational results on randomly generated and benchmark instances are reported, showing that the new heuristics are quite robust and outperform the others algorithms in the literature in terms of solution quality and computational time.
ASSUNTO(S)
hybrid heuristics path-relinking phylogeny problem heuristicas hibridas algoritmos geneticos genetic algorithms problema da filogenia reconexao por caminhos
