A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy

International Transactions in Operational Research

Volumn 16, Issue 5, 2009, Pages 641-657

  Ribeiro, Celso C ^a   Vianna, Dalessandro S ^b,c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b Universidade Candido Mendes   (Brazil)

^c Departamento de Informática   (Brazil)

Author keywords

Genetic algorithms; Path relinking; Phylogeny problem

Indexed keywords

EID: 84861181261     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00699.x     Document Type: Article

References (37)

1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C., 2002. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics 8, 343–373.
2. Aiex, R.M., Pardalos, P.M., Resende, M.G.C., Toraldo, G., 2005. GRASP with path-relinking for three-index assignment. INFORMS Journal on Computing 17, 224–247.
3. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C., 2007. TTTPLOTS: A perl program to create time-to-target plots. Optimization Letters 1, 355–366.
4. Andreatta, A.A., Ribeiro, C.C., 2002. Heuristics for the phylogeny problem. Journal of Heuristics 8, 429–447.
5. Andreatta, A.A., Carvalho, S.E.R., Ribeiro, C.C., 2002. A framework for local search heuristics for combinatorial optimization problems. In Voss, S., Woodruff, D. (eds) Optimization Software Class Libraries. Kluwer, Dordrecht, pp. 59–79.
6. Ayala, F.J., 1995. The myth of Eve: Molecular biology and human origins. Science 270, 1930–1939.
7. Cotta, C., 2006. Scatter search with path relinking for phylogenetic inference. European Journal of Operational Research 169, 520–532.
8. Edwards, A., Cavalli-Sforza, L., 1964. Reconstruction of evolutionary trees. Phenetic and Phylogenetic Classification 6, 67–76.
9. Feo, T.A., Resende, M.G.C., Smith, S.H., 1994. A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42, 860–878.
10. Festa, P., Resende, M.G.C., 2002. GRASP: An annotated bibliography. In Ribeiro, C.C., Hansen, P. (eds) Essays and Surveys in Metaheuristics. Kluwer, Dordrecht, pp. 325–367.
11. Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C., 2006. GRASP with path-relinking for the weighted MAXSAT problem. ACM Journal of Experimental Algorithmics 11, 1–16.
12. Glover, F., 1996. Tabu search and adaptive memory programing – advances, applications and challenges. In Barr, R.S., Helgason, R.V., Kennington, J.L. (eds) Interfaces in Computer Science and Operations Research. Kluwer, Dordrecht, pp. 1–75.
13. Glover, F., 2000. Multi-start and strategic oscillation methods – principles to exploit adaptive memory. In Laguna, M., Gonzáles-Velarde, J.L. (eds) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer, Dordrecht, pp. 1–24.
14. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer, Dordrecht.
15. Glover, F., Laguna, M., Martí, R., 2000. Fundamentals of scatter search and path relinking. Control and Cybernetics 39, 653–684.
16. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA.
17. Hennig, W., 1966. Phylogenetic Systematics. University of Illinois Press, Urbana.
18. Holland, J., 1992. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA.
19. Hoos, H.H., Stützle, T., 1998a. Evaluation Las Vegas algorithms – Pitfalls and remedies. In Cooper, G.F., Moral, S. (eds) Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, Madison, WI, pp. 238–245.
20. Hoos, H.H., Stützle, T., 1998b. On the Empirical Evaluation of Las Vegas Algorithms – Position paper. Technical Report, Computer Science Department, University of British Columbia.
21. Luckow, M., Pimentel, R.A., 1985. An empirical comparison of numerical Wagner computer programs. Cladistics 1, 47–66.
22. Penny, D., Foulds, L.R., Hendy, M.D., 1982. Testing the theory of evolution by comparing phylogenetic trees constructed from five different protein sequences. Nature 247, 197–200.
23. Platnick, N.I., 1987. An empirical comparison of microcomputer parsimony programs. Cladistics 3, 121–144.
24. Ranjbar, M., Kianfar, F., Shadrokh, S., 2008. Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Applied Mathematics and Computation 196, 879–888.
25. Resende, M.G.C., Ribeiro, C.C., 2003. Greedy randomized adaptive search procedures. In Glover, F., Kochenberger, G. (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp. 219–249.
26. Resende, M.G.C., Ribeiro, C.C., 2005. GRASP with path-relinking: Recent advances and applications. In Ibaraki, T., Nonobe, K., Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers. Springer, Berlin, pp. 29–63.
27. Ribeiro, C.C., Rosseti, I., 2007. Efficient parallel cooperative implementations of GRASP heuristics. Parallel Computing 33, 21–35.
28. Ribeiro, C.C., Vianna, D.S., 2003. A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. In Anais do II Workshop Brasileiro de Bioinformática. Editora Universo, Macaé, pp. 97–102.
29. Ribeiro, C.C., Vianna, D.S., 2005. A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. International Transactions in Operational Research 12, 325–338.
30. Ribeiro, C.C., Uchoa, E., Werneck, R.F., 2002. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14, 228–246.
31. Scaparra, M., Church, R., 2005. A GRASP and path relinking heuristic for rural road network development. Journal of Heuristics 11, 89–108.
32. Sober, E., 1987. Parsimony, likelihood and the principle of the common cause. Philosophy of Science 54, 465–469.
33. Swofford, D.L., 1982. Wagner Procedure Program. Illinois Natural History Survey, Champaign, IL.
34. Swofford, D.L., Olsen, G., 1990. Phylogeny reconstruction. In Hillis, D.M., Moritz, C. (eds) Molecular Systematics. Sinauer Associates, Sunderland, pp. 411–501.
35. Swofford, D.L., Olsen, G., Waddell, P.J., Hillis, D.M., 1996. Phylogeny inference. In Hillis, D.M., Moritz, C., Mable, B.K. (eds) Molecular Systematics, (2nd edn), Sinauer Sinauer Associates, pp. 407–514.
36. Vallada, E., Ruiz, R., 2006. New Genetic Algorithms with Path Relinking for the Minimum Tardiness Permutation Flowshop Problem. Universidad Politécnica de Valencia, Valencia.
37. Zhang, G.Q., Lai, K.K., 2006. Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. European Journal of Operational Research 169, 413–425.