Simulated evolutionary optimization and local search: Introduction and application to tree search

Cladistics

Volumn 17, Issue 1 II, 2001, Pages

  Moilanen, Atte ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Evolutionary optimization; Genetic algorithm; Local search; Minimum evolution tree; Optimization; Parsigal; Tree search

Indexed keywords

ALGORITHM; DNA SEQUENCE; MOLECULAR EVOLUTION; PARSIMONY ANALYSIS; PROCESS DESIGN; SEQUENCE ALIGNMENT; SIMULATION;

EVOLUTION; OPTIMIZATION; TREE;

EID: 0035002724     PISSN: 07483007     EISSN: None     Source Type: Journal    
DOI: 10.1006/clad.2000.0155     Document Type: Conference Paper

References (85)

1. E.H.L. Aarts J. Korst Simulated Annealing and Boltzmann machines 1989 Wiley Chichester
2. J.T. Alander Indexed bibliography of genetic algorithms papers of 1996 1996 University of VaasaDepartment of Information Technology and Production Economics
3. W. Atmar Notes on simulation of evolution IEEE Trans. Neural Networks 5 1994 130 147
4. T. Bäck Optimal mutation rates in genetic algorithms S. Forrest Proceedings of the 5th International Conference on Genetic Algorithms 1993 Morgan Kaufmann San Mateo 2 8
5. T. Bäck Parallel optimization of evolutionary algorithms Y. Davidor H-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 418 427
6. T. Bäck Evolutionary Algorithms in Theory and Practice 1996 Oxford Univ. Press New York
7. T. Bäck Proceedings of the 7th International Conference on Genetic Algorithms 1997 Morgan Kaufmann San Mateo
8. T. Bäck D. Fogel Z. Michalewicz Handbook of Evolutionary Computation 1997 Oxford Univ. Press New York
9. T. Bäck U. Hammel H.-P. Schwefel Evolutionary computation: Comments on the history and current state IEEE Trans. Evol. Comp. 1 1997 3 17
10. W. Banzhaf J. Daida A.E. Eiben M.H. Garzon V. Honavar M. Jakiela R.E. Smith Proceedings of the Genetic and Evolutionary Computation Conference, GECCO99 1999 Morgan Kaufman San Francisco
11. R.K. Belew When both individuals and populations search: Adding simple learning to the genetic algorithm J.D. Shaffer Proceedings of the 3rd International Conference on Genetic Algorithms 1989 Morgan Kaufmann San Mateo 110 115
12. J.L. Bernier I. Herraiz J.J. Merolo A. Prieto Solving MasterMind using GAs and simulated annealing: A case of dynamic constraint optimization H.-P. Voigt W. Ebeling I. Rechenberg H.-P. Schwefel Parallel Problem Solving from Nature 4, PPSN IV 1996 Springer-Verlag Berlin 554 563
13. H.M. Cartwright G.F. Mott Looking around: Using clues from the data space to guide genetic algorithm searches L.D. Whitley Foundations of Genetic Algorithms 2 1991 Morgan Kaufmann San Mateo 109 114
14. L.I. Cavalli-Sforza A.W.F. Edwards Phylogenetic analysis: Models and estimation procedures Evolution 21 1967 550 570
15. H. Chen S.F. Flann Parallel simulated annealing and genetic algorithms: A space of hybrid methods Y. Davidor H-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 248 257
16. D. Cvijović J. Klinowski Taboo search: An approach to the multiple minima problem Science 267 1995 664 666
17. Y. Davidor H.-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III (Lecture Notes in Computer Science, Vol. 866) 1994 Springer-Verlag Berlin
18. L. Davis Genetic Algorithms and Simulated Annealing 1987 Morgan Kaufmann San Mateo
19. L. Davis Handbook of Genetic Algorithms 1991 Van Nostrand Reinhold New York
20. B. Denzig F. Altiparmak A.E. Smith Local search genetic algorithm for optimization of highly reliable communication networks T. Bäck Proceedings of the 7th International Conference on Genetic Algorithms 1997 Morgan Kaufmann San Mateo 650 657
21. R. Dorne J.-K. Hao A new genetic local search algorithm for graph coloring A.E. Eiben T. Bäck M. Schoenauer H.-P. Schwefel Parallel Problem Solving from Nature 5, PPSN V (Lecture Notes in Computer Science, Vol. 1498) 1998 Springer-Verlag Berlin 745 754
22. D Duvivier P. Preux E.-G. Talbi Climbing up NP-hard hills H.-P. Voigt W. Ebeling I. Recenberg H.-P. Schwefel Parallel Problem Solving from Nature 4. PPSN IV (Lecture Notes in Computer Science, Vol. 1141) 1996 Springer-Verlag Berlin 574 583
23. A.E. Eiben T. Bäck M. Schoenauer H.-P. Schwefel Parallel Problem Solving from Nature 5, PPSN V (Lecture Notes in Computer Science, Vol. 1498) 1998 Springer-Verlag Berlin
24. L. Eshelman Proceedings of the 6th International Conference on Genetic Algorithms 1995 Morgan Kaufmann San Mateo
25. L.J. Eshelman J.D. Schaffer Preventing premature convergence in genetic algorithms by preventing incest R.K. Belew I. Booker Proceedings of the 4th International Conference on Genetic Algorithms 1991 Morgan Kaufmann San Mateo 115 122
26. L.J. Eshelman J.D. Schaffer Real-coded genetic algorithms and interval schemata L.D. Whitley Foundations of Genetic Algorithms 2 1993 Morgan Kaufmann San Mateo 187 202
27. L.J. Eshelman J.D. Schaffer Crossover's niche S. Forrest Proceedings of the 5th International Conference on Genetic Algorithms 1993 Morgan Kaufmann San Mateo 9 14
28. Farris, J. S. (, 1988, ), Hennig86, program and documentation, Port Jefferson, New York.
29. D.B. Fogel An introduction to simulated evolutionary optimization IEEE Trans. Neural Networks 5 1994 3 14
30. D.B. Fogel Evolutionary Computation 1995 IEEE Press Piscataway
31. L.J. Fogel P.J. Angeline T. Bäck Proceedings of the 5th Annual Conference on evolutionary Programming 1996 MIT Press Cambridge
32. S. Forrest S. Mitchell What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation Machine Learning 13 1993 285 319
33. D. Gladstein Efficient incremental character optimization Cladistics 13 1997 21 26
34. F. Glover Future paths for integer programming and links to artificial intelligence Comput. Operations Res. 13 1986 533 549
35. D.E. Goldberg Genetic Algorithms for Search, Optimization and Machine Learning 1989 Addison Wesley Reading
36. D.E. Goldberg Making genetic algorithms fly: A lesson from the Wright brothers Adv. Technol. Dev. 2 1993 1 8
37. D.E. Goldberg B. Korb K. Deb Messy genetic algorithms: Motivation, analysis, and first results Complex Syst 3 1989 493 530
38. P.A. Goloboff Methods for faster parsimony analysis Cladistics 12 1996 199 220
39. P.A. Goloboff Analysing large data sets in reasonable times; Solutions for composite optima Cladistics 15 1999 415 428
40. M. Gorges-Schleuter Comparison of local mating strategies in massively parallel genetic algorithms R. Männer B. Manderick Parallel Problem Solving from Nature 2—PPSN II 1992 Springer-Verlag Berlin 553 562
41. R.L. Graham L.R. Foulds Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time Math. Biosci. 60 1982 133 142
42. J.J. Grefenstette Optimization of control parameters for genetic algorithms IEEE Trans. Syst. Man Cybern. SMC 16 1986 122 128
43. F. Gruau D. Whitley Adding learning to the cellular development of neural networks: Evolution and the Baldwin effect Evol. Computat. 1 1993 213 234
44. G.E. Hinton S.J. Nowlan How learning can guide evolution Complex Systems 1 1987 495 502
45. J.H. Holland Adaption in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence 1975 Univ. of Michigan Press Ann Arbor
46. J. Horn D.E. Goldberg K. Deb Long path problems Y. Davidor H-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 149 158
47. H. Iba H. de Garis T. Sato Genetic programming with local hill-climbing Y. Davidor H-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 302 311
48. H. Ishibuchi T. Murata S. Tomioka Effectiveness of genetic local search T. Bäck Proceedings of the 7th International Conference on Genetic Algorithms 1997 Morgan Kaufmann San Mateo 505 512
49. C.Z. Janikow Z. Michalewicz An experimental comparison of binary and floating point representations in genetic algorithms R.K. Belew L. Booker Proceedings of the 4th International Conference on Genetic Algorithms 1991 Morgan Kaufmann San Mateo 31 36
50. P. Jog J.Y. Suh D. Van Gucht The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem J.D. Shaffer Proceedings of the 3rd International Conference on Genetic Algorithms 1989 Morgan Kaufmann San Mateo 110 115
51. T. Jones Crossover, macromutation and population based search L. Eshelman Proceedings of the 6th International Conference on Genetic Algorithms 1995 Morgan Kaufmann San Mateo 73 80
52. T. Jones G.J.E. Rawlins Reverse hill-climbing, genetic algorithms and the busy beaver problem S. Forrest Proceedings of the 5th International Conference on Genetic Algorithms 1993 Morgan Kaufmann San Mateo 70 75
53. S. Kirkpatrick C.D. Gelatt Jr. M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
54. J.R. Koza Genetic Programming 1992 MIT Press Cambridge
55. J.R. Koza D.E. Goldberg D.B. Fogel R.L. Riolo Proceedings of the 1st Annual Conference on Genetic Programming 1996 MIT Press Cambridge
56. P.S. Laursen Problem-independent parallel simulated annealing using selection and migration Y. Davidor H.-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 408 417
57. F.-T. Lin C.-Y. Kao C.-C. Hsu Applying the genetic approach to simulated annealing in solving some NP-hard problems IEEE Trans. Syst. Man Cybern. SMC 23 1993 1752 1767
58. D. Maddison The discovery and importance of multiple islands of most parsimonious trees Syst. Zool. 40 1991 315 328
59. S.W. Mahfoud A comparison of parallel and sequential niching techniques L. Eshelman Proceedings of the 6th International Conference on Genetic Algorithms 1995 Morgan Kaufmann San Mateo 13 143
60. M. McIlhagga P. Husbands R. Ives A comparison of optimization techniques for integrated manufacturing planning and scheduling H.-P. Voigt W. Ebeling I. Recenberg H.-P. Schwefel Parallel Problem Solving from Nature 4, PPSN IV (Lecture Notes in Computer Science, Vol. 1141) 1996 Springer-Verlag Berlin 604 613
61. N. Metropolis A. Rosenbluth M. Rosenbluth A. Teller E. Teller Equation of state calculations by fast computing machines J. Chem. Phys. 21 1953 1087 1092
62. Z. Michalewicz Genetic Algorithms + Data Structures = Evolution Programs 1996 Springer Berlin
63. J.A. Miller W.D. Potter R.V. Gandham C.N. Lapena An evaluation of local improvement operators for genetic algorithms IEEE Trans. Syst. Man Cybern. SMC 23 1993 1340 1351
64. M. Mitchell An Introduction to Genetic Algorithms 1996 MIT Press Cambridge
65. A. Moilanen Searching for most parsimonious trees with simulated evolutionary optimization Cladistics 15 1999 39 50
66. H. Mühlenbein How genetic algorithms really work. I. Mutation and hill-climbing R. Männer B. Manderick Parallel Problem Solving from Nature 2—PPSN II 1992 Springer-Verlag Berlin 15 25
67. H. Mühlenbein D. Schlierkamp-Voosen Predictive models for the breeder genetic algorithm. I. Continuous parameter optimization Evol. Computat. 1 1993 25 50
68. H. Mühlenbein D. Schlierkamp-Voosen The science of breeding and its application to the breeder genetic algorithm (BGA) Evol. Computat. 1 1993 335 360
69. H. Mühlenbein M. Schomisch J. Born The parallel genetic algorithm as function optimizer Parallel Comput. 17 1991 619 632
70. K.C. Nixon The Parsimony Ratchet, a new method for rapid parsimony analysis Cladistics 15 1999 407 414
71. U.-M. O'Reilly F. Oppacher Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill-climbing Y. Davidor H-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 397 406
72. K.F. Pál Selection schemes with spatial isolation for genetic optimization Y. Davidor H.-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 170 179
73. A. Phillips D. Janies W. Wheeler Multiple sequence alignment in phylogenetic analysis Mol. Phylogenet. Evol. 16 2000 317 330
74. J.-M. Renders S.P. Flasse Hybrid methods using genetic algorithms for global optimization IEEE Trans. Syst. Man Cybern. Ser. B SMC 26 1996 243 258
75. C.D. Rosin R.S. Halliday W.E. Hart R.K. Belew A comparison of global and local search methods in drug docking T. Bäck Proceedings of the 7th International Conference on Genetic Algorithms 1997 Morgan Kaufmann San Mateo 221 228
76. G. Rudolph Convergence properties of canonical genetic algorithms IEEE Trans. Neural Networks 5 1994 96 101
77. H.-P. Schwefel G. Rudolph Contemporary evolution strategies F. Morán A. Moreno J.J. Merolo P. Chacón Advances in Artificial Life: Proceedings of the 3rd International Conference on Artificial Life (Lecture Notes in Artificial Intelligence, Vol. 929) 1995 Springer-Verlag Berlin 893 907
78. D.L. Swofford G.J. Olsen Phylogeny reconstruction D.M. Hillis C. Moritz Molecular Systematics 1990 Sinauer Sunderland 411 501
79. G. Syswerda Uniform crossover in genetic algorithms J.D. Shaffer Proceedings of the 3rd International Conference on Genetic Algorithms 1989 Morgan Kaufmann San Mateo 2 9
80. A. Törn A. Žilinskas Global Optimization (Lecture Notes in Computer Science, Vol. 350) 1989 Springer-Verlag Berlin
81. J.M. Varanelli J.P. Cohoon Population-oriented simulated annealing: A genetic/thermodynamic hybrid approach to optimization L. Eshelman Proceedings of the 6th International Conference on Genetic Algorithms 1995 Morgan Kaufmann San Mateo 174 182
82. H.-P. Voigt W. Ebeling I. Recenberg H.-P. Schwefel Parallel Problem Solving from Nature 4, PPSN IV (Lecture Notes in Computer Science, Vol. 1141) 1996 Springer-Verlag Berlin
83. L.D. Whitley V.S. Gordon K. Mathias Lamarkian evolution, the Baldwin effect and function optimization Y. Davidor H.-P. Schwefel R. Männer Parallel Problem Solving from Nature 3—PPSN III 1994 Springer-Verlag Berlin 6 15
84. D.H. Wolpert W.G. Macready No free lunch theorems for optimization IEEE Trans. Evol. Comp. 1 1997 67 82
85. T. Yamada R. Nakanao Scheduling by genetic local search and multi-step crossover H.-P. Voigt W. Ebeling I. Recenberg H.-P. Schwefel Parallel Problem Solving from Nature 4, PPSN IV (Lecture Notes in Computer Science, Vol. 1141) 1996 Springer-Verlag Berlin 960 969