Genetic algorithms: Principles and perspectives: A Guide to GA theory

Operations Research/ Computer Science Interfaces Series

Volumn 20, Issue , 2002, Pages 1-326

  Reeves, Colin R ^a   Rowe, Jonathan E ^b  

^a Institute for Clean Growth and Future Mobility   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41549123185     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Article

References (350)

1. E. Aarts and J. K. Lenstra (Eds.) (1997) Local Search in Combinatorial Optimization, John Wiley & Sons, Chichester
2. A. Agapie (1998) Modeling genetic algorithms: from Markov chains to dependence with complete connections. In A. E. Eiben, T. Bäck, M. Schoenauer, H. P. Schwefel (Eds.) Parallel Problem-Solving from Nature-PPSN V, Springer-Verlag, Berlin, 3-12
3. A. Agapie (2001) Theoretical analysis of mutation-adaptive evolutionary algorithms. Evolutionary Computation 9, 127-146
4. R. K. Ahuja and J. B. Orlin (1997) Developing fitter GAs. INFORMS J on Computing, 9, 251-253
5. L. Altenberg (1995) The schema theorem and Price's theorem. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 23-49
6. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 57-64
7. L. Altenberg (1997) NK fitness landscapes. In Th. Bäck, D. B. Fogel and Z. Michalewicz (Eds.) (1997) Handbook of Evolutionary Computation, Oxford University Press, Oxford, UK
8. E. Angel and V. Zissimopolous (2000) On the classification of NP-complete problems in terms of their correlation coefficients. Discrete Applied Mathematics, 99, 261-277
9. J. Antonisse (1989) A new interpretation of schema notation that overturns the binary encoding constraint. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 86-91
10. T. Bäck (1993), Optimal mutation rates in genetic search. In S. Forrest (Ed). Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 2-9
11. Th. Bäck (1995) Generalized convergence models for tournament and μ, λ selection. In L. J. Eshelman (Ed.) (1995) Proceedings of 6th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 2-8
12. Th. Bäck (1996) Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms, Oxford University Press, Oxford
13. Th. Bäck, D. B. Fogel and Z Michalewicz (Eds.) (1997) Handbook of Evolutionary Computation, Oxford University Press, Oxford, UK
14. Th. Bäck, A. E. Eiben and N. AJ. van der Vaart (2000) An empirical study on GAs "without parameters". M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, JJ. Merelo and H-P. Schwefel (Eds.) (2000) Parallel Problem-Solving from Nature, 6, Springer-Verlag, Berlin, 315-324
15. J. E. Baker (1987) Reducing bias and inefficiency in the selection algorithm. In JJ. Grefenstette(Ed.) (1987) Proceedings of the 2nd International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, New Jersey, 14-21
16. JM. Baldwin (1896) A new factor in evolution. American Naturalist, 30, 441-451.
17. K. G. Beauchamp (1975) Walsh Functions and Their Applications. Academic Press, London
18. M. Behe (1996) Darwin's Black Box: The Biochemical Challenge to Evolution, Free Press, New York, NY
19. A. Bertoni and M. Dorigo (1993) Implicit parallelism in genetic algorithms. Artificial Intelligence, 61, 307-314
20. A. D. Bethke (1981) Genetic algorithms as function optimizers. Doctoral dissertation, University of Michigan
21. H. G. Beyer (1996) Towards a theory of evolution strategies: Self-adaptation. Evolutionary Computation, 3, 311-347
22. J. A. Bishop and L. M. Cook (1975) Moths, melanism and clean air. Scientific American, 232, 90-99
23. T. Blickle and L. Thiele (1995) A mathematical analysis of tournament selection. In L. J. Eshelman (Ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 9-16
24. T. Blickle and L. Thiele (1996) A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4, 361-394
25. K. D. Boese, A. B. Kahng and S. Muddu (1994) A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16, 101-113
26. L. B. Booker (1987) Improving search in genetic algorithms. In L. Davis (Ed.) (1987) Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, Los Altos, CA, 61-73
27. S. Bornholdt (1997) Probing genetic algorithm performance of fitness landscapes. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 141-154
28. G. E. P. Box and G. M. Jenkins (1970) Time Series Analysis, Forecasting and Control, Holden Day, San Francisco, CA
29. H. J. Bremermann (1962) Optimization through Evolution and Recombination, Spartan Books, Washington, DC
30. H. J. Bremermann, J. Rogson and S. Salaff (1966) Global properties of evolution processes. In H. H. Pattee (Ed.) (1966) Natural Automata and Useful Simulations, 3-42
31. C. L. Bridges and D. E. Goldberg (1987) An analysis of reproduction and crossover in a binary-coded genetic algorithm. In J. J. Grefenstette(Ed.) (1987) Proceedings of the 2nd International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Hillsdale, NJ, 9-13
32. A. Brown (1999) The Darwin Wars, Simon and Schuster, London
33. R. A. Caruana and J. D. Schaffer (1988) Representation and hidden bias: Gray vs. binary coding for genetic algorithms. Proceedings of the 5th International Conference on Machine Learning. Morgan Kaufmann, Los Altos, CA, 153-161
34. R. Cerf (1998) Asymptotic convergence of genetic algorithms. Advances in Applied Probability 30(2), 521-550
35. L. Chambers (Ed.) (1995) Practical Handbook of Genetic Algorithms: Applications, Volume I, CRC Press, Boca Raton, FL
36. L. Chambers (Ed.) (1995) Practical Handbook of Genetic Algorithms: New Frontiers, Volume II, CRC Press, Boca Raton, FL
37. S. Chen and S. Smith (1999) Putting the "genetics" back into genetic algorithms. In W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, 103-116
38. P. C. Chu and J. E. Beasley (1998) Constraint handling in genetic algorithms: The set partitioning problem. Journal of Heuristics, 4, 323-358
39. J. A. Coyne (1998) Not black and white. Nature, 396, 35-36
40. G. A. Croes (1958) A method for solving travelling salesman problems. Operations Research, 6, 791
41. J. C. Culberson (1995) Mutation-crossover isomorphisms and the construction of discriminating functions. Evolutionary Computation, 2, 279-311
42. J. Culberson (1998) On the futility of blind search: An algorithmic view of "No Free Lunch". Evolutionary Computation, 6, 109-127
43. J. M. Daida, S. P. Yalcin, P. M. Litvak, G. A. Eickhoff and J. A. Polito (1999) Of metaphors and Darwinism: deconstructing genetic programming's chimera. In P. J. Angeline (Ed.) (1999) Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 453-462
44. C. R. Darwin (1859) On the Origin of Species by Means of Natural Selection or the Preservation of Favoured Races in the Struggle for Life, John Murray, London
45. Y. Davidor (1990) Epistasis variance: suitability of a representation to genetic algorithms. Complex Systems, 4, 369-383
46. Y. Davidor (1991) Epistasis variance: a viewpoint on GA-hardness. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 23-35
47. L. Davis (Ed.) (1991) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York
48. L. D. Davis, D. Orvosh, A. Cox and Y. Qiu (1993) A genetic algorithm for survivable network design. In S. Forrest (Ed.) (1993) Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 408-415
49. T. E. Davis and J. C. Principe (1991) A simulated annealing like convergence theory for the simple genetic algorithm. In R. K. Belew and L. B. Booker (Eds.) Proceedings of the fourth Int. Conf. on Genetic Algorithms, Morgan Kauffman, San Mateo, CA, 174-181
50. T. E. Davis and J. C. Principe (1993) A Markov chain framework for the simple genetic algorithm. Evolutionary Computation, 1, 269-288
51. R. Dawkins (1982) The Extended Phenotype, Longman, London
52. R. Dawkins (1986) The Blind Watchmaker, Longman, London
53. R. Dawkins (1996) Climbing Mount Improbable, Viking, London
54. K. Deb and D. E. Goldberg (1993) Analyzing deception in trap functions. In L. D. Whitley (Ed.) (1993) Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA, 93-108
55. K. A. De Jong (1975) An analysis of the behavior of a class of genetic adaptive systems, Doctoral dissertation, University of Michigan, Ann Arbor, Michigan [Available as PDF files from http://cs.gmu.edu/~eclab/kdj_thesis.html]
56. K. A. De Jong (1992) Are genetic algorithms function optimizers? In R. Männer and B. Manderick (Eds.) (1992) Parallel Problem-Solving from Nature, 2, Elsevier Science Publishers, Amsterdam, 3-13
57. K. A. De Jong and W. M. Spears (1992) A formal analysis of the role of multi-point crossover in genetic algorithms. Annals of Maths. and AI, 5, 1-26
58. K. A. De Jong (1993) Genetic algorithms are NOT function optimizers. In D. Whitley (Ed.) (1993) Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA, 5-18
59. K. A. De Jong, W. M. Spears and D. F. Gordon (1995) Using Markov chains to analyze GAFOs. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 115-137
60. K. A. De Jong (2002) Evolutionary Computation, MIT Press, Cambridge, MA
61. D. J. Depew and B. H. Weber (1995) Darwinism Evolving: Systems Dynamics and the Genealogy of Natural Selection, MIT Press, Cambridge, MA
62. T. Dobzhansky (1962) Mankind Evolving, Yale University Press, New Haven, CT
63. S. Droste, T. Jansen and I. Wegener (1999) Perhaps not a free lunch but at least a free appetizer. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Hanavar, M. Jakiela and R. E. Smith (Eds.) Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, San Francisco, CA, 833-839
64. S. Droste, T. Jansen and I. Wegener (2001) Optimization with randomized search heuristics: The (A)NFL theorem, realistic scenarios and difficult functions. J. Theoretical Computer Science, (to appear)
65. D-Z. Du and P. M. Pardalos (1998) Handbook of Combinatorial Optimization: Volumes 1-3, Kluwer Academic Publishers, Dordrecht, NL
66. M. Eigen (1971) Self-organization of matter and the evolution of biological macromolecules. Die Naturwissenschaften, 10, 465-523
67. N. Eldredge and S. J. Gould (1973) Punctuated equilibria: An alternative to phyletic gradualism. In T. J. M. Schopf (Ed.) (1973) Models in Paleobiology, Freeman Cooper, San Francisco, CA, 82-115
68. T. M. English (1999) Some information theoretic results on evolutionary optimization. In P. J. Angeline (Ed.) (1999) Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 788-795
69. T. M. English (2000) Optimization is easy and learning is hard in the typical function. In Proceedings of the 2000 Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 924-931
70. T. M. English (2000) Practical implications of new results in conservation of optimizer performance. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo and H-P. Schwefel (Eds.) (2000) Parallel Problem-Solving from Nature, 6, Springer-Verlag, Berlin, 69-78,
71. A. Eremeev and C. R. Reeves (2002) Non-parametric estimation of properties of combinatorial landscapes. To appear in J. Gottlieb and G. Raidl (Eds.) (2002) Proceedings of EvoCOP-2002, Springer-Verlag, Berlin
72. L. J. Eshelman, R. A. Caruana and J. D. Schaffer (1989) Biases in the crossover landscape. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 10-19
73. L. J. Eshelman (1991) The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 265-283
74. L. J. Eshelman and J. D. Schaffer (1993) Crossover's niche. In S. Forrest (Ed.) (1993) Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 9-14
75. A. Fairley (1991) Comparison of methods of choosing the crossover point in the genetic crossover operation. Technical Report, Dept. of Computer Science, University of Liverpool, UK
76. E. Falkenauer (1998) Genetic Algorithms and Grouping Problems, John Wiley & Sons, Chichester
77. T. C. Fogarty (1989) Varying the probability of mutation in the genetic algorithm. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 104-109
78. D. B. Fogel and J. W. Atmar (1990) Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biological Cybernetics, 63, 111-114
79. D. B. Fogel (1998) Evolutionary Computation: The Fossil Record, IEEE Press, Piscataway, N J
80. D. B. Fogel (1999) An overview of evolutionary programming. In L. D. Davis, K. A. De Jong, M. D. Vose and L. D. Whitley (Eds.) (1999) Evolutionary Algorithms: IMA Volumes in Mathematics and its Applications, Vol 111, Springer-Verlag, New York, 89-109
81. L. J. Fogel (1963) Biotechnology: Concepts and Applications, Prentice-Hall, Englewood Cliffs, N J
82. L. J. Fogel, A. J. Owens and M. J. Walsh (1966) Artificial Intelligence through Simulated Evolution, John Wiley, New York
83. C. Fonlupt, D. Robilliard and P. Preux (1998) A bit-wise epistasis measure for binary search spaces. In A. E. Eiben, T. Bäck, M. Schoenauer, H. P. Schwefel (Eds.) Parallel Problem-Solving from Nature-PPSN V, Springer-Verlag, Berlin, 47-56
84. C. M. Fonseca and P. J. Fleming (1995) An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3, 1-16
85. B. R. Fox and M. B. McMahon (1991) Genetic operators for sequencing problems. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 284-300
86. A. S. Fraser (1962) Simulation of genetic systems, Journal of Theoretical Biology, 2, 329-346
87. P. Galinier and J. Hao (1999) Hybrid evolutionary algorithms for graph coloring. In Journal of Combinatorial Optimization, 3, 379-397
88. M. R. Garey and D. S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, C A
89. L. L. Gatlin (1972) Information Theory and the Living System, Columbia University Press, New York
90. H. Geiringer (1944) On the probability theory of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15, 25-57
91. F. Glover and M. Laguna (1993) Tabu Search. Chapter 3 in [213]
92. F. Glover (1994) Genetic algorithms and scatter search: unsuspected potentials. Statistics and Computing, 4, 131-140
93. D. E. Goldberg (1985) Optimal initial population size for binary-coded genetic algorithms. TCGA Report 85001, University of Alabama, Tuscaloosa
94. D. E. Goldberg and R. Lingle (1985) Alleles, loci and the traveling salesman problem. In J. J. Grefenstette(Ed.) (1985) Proceedings of an International Conference on Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, Hillsdale, New Jersey, 154-159
95. D. E. Goldberg and J. Richardson (1987) Genetic algorithms with sharing for multimodal function optimization. In J. J. Grefenstette(Ed.) (1987) Proceedings of the 2nd International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Hillsdale, N J, 41-49
96. D. E. Goldberg (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts
97. D. E. Goldberg (1989) Sizing populations for serial and parallel genetic algorithms. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, San Ma-teo, CA, 70-79
98. D. E. Goldberg (1989) Genetic algorithms and Walsh functions: part I, a gentle introduction. Complex Systems, 3, 129-152
99. D. E. Goldberg (1989) Genetic algorithms and Walsh functions: part II, deception and its analysis. Complex Systems, 3, 153-171
100. D. E. Goldberg and K. Deb (1991) A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 69-93
101. D. E. Goldberg, K. Deb and J. H. Clark (1992) Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6, 333-362
102. B. Goodwin (1995) Neo-Darwinism has failed as an evolutionary theory. Times Higher Education Supplement, May 19 1995
103. B. Goodwin (1995) How the Leopard Changed Its Spots, Weidenfeld and Nicholson, London
104. S. J. Gould and R. Lewontin (1979) The spandrels of San Marco and the Panglossian paradigm: A critique of the adaptationist programme. Proceedings of the Royal Society, B205
105. R. L. Graham, D. E. Knuth and O. Patashnik (1994) Concrete Mathematics (2nd Edition), Addison-Wesley
106. J. J. Grefenstette (1986) Optimization of control parameters for genetic algorithms. IEEE-SMC, SMC-16, 122-128
107. J. J. Grefenstette (1993) Deception considered harmful. In [346], 75-91
108. G. R. Grimmett and D. R. Stirzaker (2001) Probability and Random Processes, 3rd edition, Oxford University Press, Oxford, UK
109. L. K. Grover (1992) Local search and the local structure of NP-complete problems. Operations Research Letters, 12, 235-243
110. J. B. S. Haldane (1931) A mathematical theory of natural selection, Part VI: Metastable populations. Proceedings of the Cambridge Philosophical Society, 27, 137-142
111. P. J. B. Hancock (1994) An empirical comparison of selection methods in evolutionary algorithms. In T. C. Fogarty (Ed.) (1994) Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers, Springer-Verlag, Berlin, 80-94
112. P. J. B. Hancock (1996) Selection methods for evolutionary algorithms. In L. Chambers (Ed.) (1995) Practical Handbook of Genetic Algorithms: New Frontiers, Volume II, CRC Press, Boca Raton, FL, 67-92
113. J. He and X. Yao (2001) Drift analysis and average time complexity of evolutionary algorithms. In Artificial Intelligence, 127, 57-85
114. R. Heckendorn, S. Ranaand D. Whitley (1997) Nonlinearity, hyperplane ranking and the simple genetic algorithm. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kauf-mann, San Francisco, CA, 181-202
115. R. B. Heckendorn and D. Whitley (1997) A Walsh analysis of NK-landscapes. In Th. Bäck (Ed.) (1997) Proc. 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 41-48
116. R. B. Heckendorn, D. Whitley and S. Rana (1997) Nonlinearity, hyper-plane ranking and the simple genetic algorithm. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 181-201
117. R. B. Heckendorn and D. Whitley (1998) Predicting epistasis directly from mathematical models. Technical Report, Dept of Computer Science, Colorado State University, USA
118. R. Heckendorn, S. Rana and D. Whitley (1999) Test function generators as embedded landscapes. In W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA
119. K. Hinkelmann and O. Kempthorne (1994) The Design and Analysis of Experiments. John Wiley & Sons, New York
120. G. E. Hinton and S. J. Nowlan (1987) How learning can guide evolution. Complex Systems, 1, 495-502
121. nd Conference on Massively Parallel Computing Systems, IEEE Computer Society, Los Alamitos, CA, 23-30
122. nd Nordic Workshop on Genetic Algorithms and their Applications, University of Vaasa Press, Vaasa, Finland, 27-43
123. C. Höhn and C. R. Reeves (1996) Are long path problems hard for genetic algorithms? In H-M. Voigt, W. Ebeling, I. Rechenberg and H-P. Schwefel (Eds.) (1996) Parallel Problem-Solving from Nature-PPSN IV, Springer-Verlag, Berlin, 134-143
124. J. H. Holland (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan
125. J. H. Holland (1986) Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J. G. Carbonell and T. M. Mitchell (1986) Machine Learning II, Morgan Kaufmann, Los Altos, CA
126. J. H. Holland (1992) Adaptation in Natural and Artificial Systems, 2nd edition, MIT Press, Cambridge, MA
127. J. H. Holland (2000) Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evolutionary Computation, 8, 373-391
128. J. Hooker (1995) Testing heuristics: We have it all wrong. J. Heuristics, 1, 33-42
129. R. Hooykaas (1972) Religion and the Rise of Modern Science. Wm. B. Erdmans, Grand Rapids, Michigan
130. J. Horn, D. E. Goldberg, and K. Deb (1994) Long path problems. In Y. Davidor, H-P. Schwefel and R. Männer (Eds.) (1994) Parallel Problem-Solving from Nature, 3, Springer-Verlag, Berlin, 134-143
131. J. Horn and D. E. Goldberg (1999) Towards a control map for niching. In W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, 287-310
132. C. Igel and M. Toussaint (2002) On classes of functions for which no free lunch results hold. Submitted to IEEE Transactions on Evolutionary Computation
133. T. Jansen and I. Wegener (2001) Real royal road functions-where crossover provably is essential. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H. -M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.) (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), Morgan Kauf-mann, San Francisco, CA, 1034-1041
134. D. S. Johnson (1990) Local optimization and the traveling salesman problem. In G. Goos and J. Hartmanis (Eds.) (1990) Automata, Languages and Programming, Lecture Notes in Computer Science 443, Springer-Verlag, Berlin, 446-461
135. T. C. Jones (1995) Evolutionary Algorithms, Fitness Landscapes and Search, Doctoral dissertation, University of New Mexico, A lbuquerque, N M
136. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 73-80
137. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 184-192
138. B. Julstrom (1999) It's all the same to me: Revisiting rank-based probabilities and tournaments. In P. J. Angeline (Ed.) (1999) Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Piscat-away, NJ, 1501-1505
139. L. Kallel and M. Schoenauer (1997) Alternative random initialization in genetic algorithms. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 268-275
140. L. Kallel and J. Garnier (2001) How to Detect All Maxima of a Function. In L. Kallel, B. Naudts and A. Rogers (2001) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin, 343-370
141. L. Kallel, B. Naudts and C. R. Reeves (2001) Properties of Fitness Functions and Search Landscape. In L. Kallel, B. Naudts and A. Rogers (2001) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin, 175-206
142. L. Kallel, B. Naudts and A. Rogers (2001) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin
143. A. Kapsalis, G. D. Smith and V. J. Rayward-Smith (1993) Solving the graphical Steiner tree problem using genetic algorithms. J. Operational Research Society, 44, 397-406
144. S. Kauffman (1993) The Origins of Order: Self-Organisation and Selection in Evolution. Oxford University Press, Oxford, UK
145. S. Kauffman (1995) At Home in the Universe, Penguin, London
146. B. Kettlewell (1956) A résumé of investigations on the evolution of melanism in the Lepidoptera. Proceedings of the Royal Society, B145, 297-303
147. W. Khatib and P. J. Fleming (1998) The stud GA: A mini revolution? In A. E. Eiben, T. Bäck, M. Schoenauer, H. P. Schwefel (Eds.) Parallel Problem-Solving from Nature, 5, Springer-Verlag, Berlin, 683-691
148. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (Eds.) (1990) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley, Chichester
149. P. L'Ecuyer and C. Lemieux (2000) Variance reduction via lattice rules. Management Science, 46, 1214-1235
150. J. Levenhagen, A. Bortfeldt and H. Gehring (2001) Path tracing in genetic algorithms applied to the multiconstrained knapsack problem. In E. J. W. Boers et al. (Eds.) (2001) Applications of Evolutionary Computing, Springer-Verlag, Berlin, 40-49
151. D. Levine (1997) GAs: A practitioner's view. INFORMS J on Computing, 9, 256-257
152. S. Lin (1965) Computer solutions of the traveling salesman problem. Bell Systems Tech. J.,44,2245-2269
153. S. L. Lohr (1999) Sampling: Design and Analysis, Duxbury Press, Pacific Grove, CA
154. M. Lundy and A. Mees (1986) Convergence of an annealing algorithm. Mathematical Programming, 34, 111-124
155. W. G. Macready and D. H. Wolpert (1998) Bandit problems and the exploration/exploitation tradeoff. IEEE Transactions on Evolutionary Computation, 2, 2-13
156. M. E. N. Majerus (1998) Melanism: Evolution in Action Oxford University Press, Oxford, UK
157. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 143-150
158. O. Martin, S. W. Otto and E. W. Felten (1992) Large step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters, 11, 219-224
159. E. Mayr (1970) Populations, Species, and Evolution, Harvard University Press, Cambridge, Mass
160. E. Mayr (1982) The Growth of Biological Thought: Diversity, Evolution, and Inheritance, The Belknap Press of Harvard University Press, Cambridge, MA
161. M. D. McKay, W. J. Conover and R. J. Beckman (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics, 21, 239-245
162. S. McKee and M. B. Reed (1987) An algorithm for the alignment of gas turbine components in aircraft. IMA J Mathematics in Management, 1, 133-144
163. P. Merz and B. Freisleben (1998) Memetic algorithms and the fitness landscape of the graph bi-partitioning problem. In A. E. Eiben, Th. Back, M. Schoenauer, H-P. Schwefel (Eds.) (1998) Parallel Problem-Solving from Nature-PPSN V, Springer-Verlag, Berlin, 765-774
164. P. Merz and B. Preisleben (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation, 4, 337-352
165. M. M. Meysenburg and J. A. Foster (1997) The quality of pseudorandom number generators and simple genetic algorithm performance. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 276-282
166. Z. Michalewicz (1996) Genetic Algorithms + Data Structures = Evolution Programs (3rd edition), Springer-Verlag, Berlin
167. Z. Michalewicz and M. Schoenauer (1996) Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4, 1-32
168. M. Midgley (1985) Evolution as a Religion: Strange Hopes and Stranger Fears, Methuen, London
169. M. Mitchell, J. H. Holland and S. Forrest (1994) When will a genetic algorithm outperform hill climbing? In J. D. Cowan, G. Tesauro and J. Alspector (Eds.) (1994) Advances in Neural Information Processing Systems 6, Morgan Kaufmann, San Mateo, CA
170. M. Mitchell (1996) An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA
171. J. B. Mitton (1997) Selection in Natural Populations, Oxford University Press, Oxford
172. D. C. Montgomery (1997) Design and Analysis of Experiments. Wiley, New York
173. H. Mühlenbein (1991) Evolution in time and space-the parallel genetic algorithm. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 316-337
174. H. Mühlenbein (1992) How genetic algorithms really work: mutation and hill-climbing. In R. Männer and B. Manderick (Eds.), Parallel Problem Solving from Nature, Elsevier Science Publishers, Amsterdam, 15-26
175. H. Mühlenbein and D. Schlierkamp-Voosen (1994) The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1, 335-360
176. H. Mülenbein and T. Mahnig (2001) Evolutionary algorithms: from recombination to search distributions. In L. Kallel, B. Naudts and A. Rogers (Eds.) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin, 135-173
177. Y. Nagata and S. Kobayashi (1997) Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 450-457
178. B. Naudts (1998) Measuring GA-Hardness, Doctoral thesis, University of Antwerp, RUCA, Belgium
179. B. Naudts and J. Naudts (1998) The effect of spin-flip symmetry on the performance of the simple GA. In A. E. Eiben, Th. Bäck, M. Schoenauer, H-P. Schwefel (Eds.) Parallel Problem-Solving from Nature-PPSN V, Springer-Verlag, Berlin, 67-76
180. B. Naudts and L. Kallel (2000) A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 4, 1-15
181. A. Nijenhuis and H. S. Wilf (1978) Combinatorial Algorithms for Computers and Calculators. Academic Press, New York
182. A. E. Nix and M. D. Vose (1992) Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence, 5, 79-88
183. C. E. Nugent, T. E. Vollman and J. E. Ruml (1968) An experimental comparison of techniques for the assignment of facilities to locations. Operations Research, 16, 150-173
184. D. Orvosh and L. D. Davis (1993) Shall we repair? Genetic algorithms, combinatorial optimization and feasibility constraints. In S. Forrest (Ed.) (1993) Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 650
185. C. H. Papadimitriou and K. Steiglitz (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ
186. C. Patterson (1999) Evolution, Comstock Press, Ithaca, NY
187. R. Poli (1999) Schema theorems without expectations. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Hanavar, MJakiela and R. E. Smith (Eds.) Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, San Francisco, CA
188. R. Poli (2001) Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. In W. N. Martin and W. M. Spears (Eds.) (2001) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco, CA, 143-163
189. R. Poli, J. E. Rowe and N. F. McPhee (2001) Markov chain models for GP and variable-length GAs with homologous crossover. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H. -M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.) (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), Morgan Kaufmann, San Francisco, CA, 112-119
190. P. WPoon and J. N. Carter (1995) Genetic algorithm crossover operators for ordering applications. Computers & Operations Research, 22, 135-147
191. W. H. Press, S. A. Teukolsky, W. T. Vetterling and B. P. Flannery (1992) Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, Cambridge, UK
192. G. R. Price (1970) Selection and covariance. Nature, 227, 520-521
193. W. B. Provine (1971) The Origins of Theoretical Population Genetics, University of Chicago Press, Chicago
194. W. B. Provine (1986) Sewall Wright and Evolutionary Biology, University of Chicago Press, Chicago, IL
195. A. Prügel-Bennett and J. L. Shapiro (1997) The dynamics of a genetic algorithm for simple Ising systems, Physica D, 104, 75-114
196. A. Prügel-Bennett and A. Rogers (2001) Modelling genetic algorithm dynamics. In L. Kallel, B. Naudts and A. Rogers (Eds.) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin, 59-86
197. R-J. Quick, V. J. Ray ward-Smith and G. D. Smith (1998) Fitness distance correlation and ridge functions. In A. E. Eiben, Th. Bäck, M. Schoenauer, H-P. Schwefel (Eds.) Parallel Problem-Solving from Nature-PPSN V, Springer-Verlag, Berlin, 77-86
198. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 222-229
199. N. J. Radcliffe (1991) Equivalence class analysis of genetic algorithms. Complex Systems, 5, 183-205
200. N. J. Radcliffe (1992) Non-linear genetic representations. In R. Männer and B. Manderick (Eds.) (1992) Parallel Problem-Solving from Nature, 2, Elsevier Science Publishers, Amsterdam, 259-268
201. N. J. Radcliffe and F. A. W. George, 1993. A study in set recombination. In S. Forrest (Ed.) (1993) Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 23-30
202. N. J. Radcliffe (1994) The algebra of genetic algorithms. Annals of Maths, and Artificial Intelligence, 10, 339-384
203. N. J. Radcliffe and P. D. Surry (1994) Formal memetic algorithms. In T. C. Fogarty (Ed.) (1994) Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers, Springer-Verlag, Berlin, 1-16
204. N. J. Radcliffe and P. D. Surry (1995) Formae and the variance of fitness. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 51-72
205. N. J. Radcliffe (1997) Schema processing. In Th. Bäck, D. B. Fogel and Z. Michalewicz (Eds.) Handbook of Evolutionary Computation, Oxford University Press, Oxford, UK
206. N. J. Radcliffe and P. D. Surry (1997) Fundamental limitations on search algorithms: Evolutionary computing in perspective. In J. van Leeuwen (Ed.) (1997) Lecture Notes in Computer Science 1000, Springer-Verlag, Berlin, 275-291
207. S. Rana and D. Whitley (1997) Bit representations with a twist. In Th. Back (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 188-195
208. S. Rana (1999) Examining the Role of Local Optima and Schema Processing in Genetic Search. Doctoral thesis, Colorado State University, Fort Collins, CO
209. L. M. Rattray (1995) The dynamics of a genetic algorithm under stabilizing selection. Complex Systems, 9, 213-234
210. L. M. Rattray and J. L. Shapiro (1996) The dynamics of a genetic algorithm for a simple learning problem. Journal of Physics A, 29, 7451-7453
211. nd edition 1993)
212. J. Rees and G. J. Koehler (1999) An investigation of GA performance results for different cardinality alphabets. In L. D. Davis, K. A. De Jong, M. D. Vose and L. D. Whitley (Eds.) (1999) Evolutionary Algorithms: IMA Volumes in Mathematics and its Applications, Vol 111, Springer-Verlag, New York, 191-206
213. C. R. Reeves (Ed.) (1993) Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, UK; re-issued by McGraw-Hill, London, UK (1995)
214. C. R. Reeves (1994) Genetic algorithms and neighbourhood search. In T. C. Fogarty (Ed.) (1994) Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers, Springer-Verlag, Berlin, 115-130
215. C. R. Reeves (1994) Tabu search solves GA-hard problems in polynomial time. Presented at 15th International Symposium on Mathematical Programming, Ann Arbor, Michigan
216. C. R. Reeves (1995) A genetic algorithm for flowshop sequencing. Computers & Operations Research, 22, 5-13
217. C. R. Reeves and C. C. Wright (1995) An experimental design perspective on genetic algorithms. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 7-22
218. th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 217-224
219. C. R. Reeves (1996) Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63, 371-396
220. C. R. Reeves (1996) Heuristic search methods: A review. In D. Johnson and F. O'Brien (1996) Operational Research: Keynote Papers 1996, Operational Research Society, Birmingham, UK, pages 122-149. ISBN 0903440164
221. C. R. Reeves (1997) Genetic algorithms for the Operations Researcher. INFORMS J on Computing, 9, 231-250
222. C. R. Reeves and T. Yamada (1998) Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation, 6, 45-60
223. C. R. Reeves (1999) Predictive measures for problem difficulty. In Proceedings of 1999 Congress on Evolutionary Computation, IEEE Press, 736-743
224. C. R. Reeves (1999) Landscapes, operators and heuristic search. Annals of Operations Research, 86, 473-490
225. C. R. Reeves and C. C. Wright (1999) Genetic algorithms and the design of experiments. In L. D. Davis, K. A. De Jong, M. D. Vose and L. D. Whitley (Eds.) (1999) Evolutionary Algorithms: IMA Volumes in Mathematics and its Applications, Vol 111, Springer-Verlag, New York, 207-226
226. C. R. Reeves and T. Yamada (1999) Goal-Oriented Path Tracing Methods. In D. A. Corne, M. Dorigo and F. Glover (Eds.) (1999) New Methods in Optimization, McGraw-Hill, London
227. C. R. Reeves (2000) Fitness landscapes and evolutionary algorithms. In C. Fonlupt, J-K. Hao, E. Lutton, E. Ronald and M. Schoenauer (Eds.) (2000) Artificial Evolution: 4th European Conference; Selected Papers. Springer-Verlag, Berlin, 3-20
228. C. R. Reeves (2000) Experiments with tunable fitness landscapes. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo and H-P. Schwefel (Eds.) (2000) Parallel Problem-Solving from Nature-PPSN VI, Springer-Verlag, Berlin, 139-148
229. C. R. Reeves (2001) Direct statistical estimation of GA landscape features. In W. N. Martin and W. M. Spears (Eds.) (2001) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco, CA, 91-107
230. C. R. Reeves (2002) Estimating the number of optima in a landscape, Part I: Statistical principles. (In review)
231. C. R. Reeves (2002) Estimating the number of optima in a landscape, Part II: Experimental investigations. (In review)
232. C. R. Reeves (2002) The crossover landscape and the Hamming landscape for binary search spaces. To appear in Foundations of Genetic Algorithms 7, Morgan Kaufmann, San Francisco, CA
233. R. G. B. Reid (1985) Evolutionary Theory: the Unfinished Synthesis, Croom Helm, London
234. C. M. Reidys and P. F. Stadler (2002) Combinatorial landscapes. SIAM Review, 44, 3-54
235. G. Reinelt (1994) The Travelling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, Berlin
236. M. Ridley (1993) Evolution, Blackwell Scientific Press, Oxford, UK
237. S. M. Roberts and B. Flores (1966) An engineering approach to the travelling salesman problem. Management Science, 13, 269-288
238. S. Rochet (1997) Epistasis in genetic algorithms revisited. Information Science
239. H. Rosé, W. Ebeling and T. Asselmeyer (1996) The density of states- a measure of the difficulty of optimization problems. In H-M Voigt, W. Ebeling, I. Rechenberg and H-P Schwefel (Eds.) (1996) Parallel Problem-Solving from Nature-PPSN IV, Springer-Verlag, Berlin
240. P. Ross (1997) srandom() anomaly. Genetic Algorithms Digest, http://www.www.aic.nrl.navy.mil/galist/ 11:23
241. P. Ross (1997) What are GAs good at? INFORMS J on Computing, 9, 260-262
242. J. E. Rowe (1999) Population fixed-points for functions of unitation. In W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, 69-84
243. J. E. Rowe (2001) A normed space of genetic operators with applications to scalability issues. Evolutionary Computation, 9, 25-42
244. J. E. Rowe, M. D. Vose and A. H. Wright (2001) Group properties of crossover and mutation. Evolutionary Computation, 10, 151-184
245. J. E. Rowe, M. D. Vose and A. H. Wright (2001) Structural search spaces and genetic operators. In preparation
246. G. Rudolph (1997) Reflections on bandit problems and selection methods in uncertain environments. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kauf-mann, San Francisco, CA, 166-173
247. G. Rudolph (1997) Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovac, Hamburg, Germany
248. G. Rudolph (2000) Takeover times and probabilities of non-generational selection rules. In D. Whitley, D. E. Goldberg, E. Cantú-Paz, L. Spector, I. Parmee, and H. -G. Beyer (Eds.) (2000) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), Morgan Kaufmann, San Francisco, 903-910
249. G. Rudolph (2001) Takeover times of noisy non-generational selection rules that undo extinction. In V. Kurková, N. C. Steele, R. Neruda and M. Kárný (Eds.) (2001) Proceedings of the 5th International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna, 268-271
250. E. Saliby (1990) Descriptive sampling: A better approach to Monte Carlosimulation. Journal of Operational Research Society, 41, 1133-1142
251. R. Salomon (1999) The deterministic genetic algorithm: implementation details and some results. In P. J. Angeline (Ed.) (1999) Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Pis-cataway, N J, 695-702
252. T. D. Sargent, C. D. Millar and D. M. Lambert (1998) The 'classical' explanation of industrial melanism: Assessing the evidence. In M. K. Hecht et al. (1998) Evolutionary Biology, 30, 299-322, Plenum Press, New York
253. C. Schaffer (1994) A conservation law for generalization performance. In H. Willian and W. Cohen (Eds.) (1994) Proceedings of 11th International Conference on Machine Learning, Morgan Kaufmann, San Mateo, CA, 259-265
254. J. D. Schaffer, R. A. Caruana, L. J. Eshelman and R. Das (1989) A study of control parameters affecting online performance of genetic algorithms for function optimization. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 51-60
255. J. D. Schaffer and L. J. Eshelman (1996) Combinatorial optimization by genetic algorithms: The value of the genotype/phenotype distinction. In V. J. Rayward-Smith, I. H. Osman, C. R. Reeves and G. D. Smith (Eds.) (1996) Modern Heuristic Search Methods. John Wiley & Sons, Chich-ester, UK, 85-97
256. L. Schmitt, C. L. Nehaniv and R. H. Fujii (1998) Linear analysis of genetic algorithms. Theoretical Computer Science, 200, 101-134
257. L. Schmitt (2001) Theory of genetic algorithms. Theoretical Computer Science, 259, 1-61
258. N. N. Schraudolph and R. K. Belew (1992) Dynamic parameter encoding for genetic algorithms. Machine Learning, 9, 9-21
259. C. Schumacher, M. D. Vose and L. D. Whitley (2001) The no free lunch theorem and description length. In L. Spector, E. Goodman, A. Wu, W. Langdon, H. -M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezekh, M. Garzon and E. Burke (Eds.) (2001) Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, San Francisco, CA, 565-570
260. H-P. Schwefel (1977) Numerische Optimierung von Computer-modellen mittels der Evolutionsstrategie, Birkhäuser Verlag, Basel. (English edition: Numerical Optimization of Computer Models, John Wiley & Sons, Chichester, 1981.)
261. J. Shapiro (1997) A third way. Boston Review, 22(1), 32-33
262. J. Shapiro (2002) A 21st Century view of evolution, J. Biol. Phys, to appear
263. J. Shapiro (2001) Statistical mechanics theory of genetic algorithms. In L. Kallel, B. Naudts and A. Rogers (Eds.) Theoretical Aspects of Evolutionary Computing, Springer-Verlag, Berlin, 87-108
264. J. Shapiro and A. Prügel-Bennett (1997) Genetic algorithm dynamics in a two-well potential. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 101-116
265. O. Sharpe (1998) On problem difficulty and further concerns with fitness-distance correlations. In Symposium on Genetic Algorithms 1998
266. S. S. Skiena (2000) The Stony Brook Algorithm Repository, http://www.cs.sunysb.edu/algorith/index.html
267. T. Soule and J. A. Foster (1997) Genetic algorithm hardness measures applied to the maximum clique problem. In Th. Bäck (Ed.) (1997) Proc. 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 81-88
268. W. M. Spears and K. A. De Jong (1997) Analyzing GAs using Markov models with semantically ordered and lumped states. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 85-100
269. P. F. Stadler (1995) Towards a Theory of Landscapes. In R. Lopéz-Peña, R. Capovilla, R. Garcia-Pelayo, H. Waelbroeck and F. Zertuche (Eds.) Complex Systems and Binary Networks, Springer-Verlag, Berlin, 77-163
270. P. F. Stadler and G. P. Wagner (1998) Algebraic theory of recombination spaces. Evolutionary Computation, 5, 241-275
271. P. F. Stadler, R. Seitz and G. P. Wagner (2000) Population dependent Fourier decomposition of fitness landscapes over recombination spaces: Evolvability of Complex Characters Bulletin of Mathematical Biology, 62, 399-428
272. C. R. Stephens and H. Waelbroeck (1997) Effective degrees of freedom in genetic algorithms and the block hypothesis. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 34-40
273. C. R. Stephens and H. Waelbroeck (1999) Schemata evolution and building blocks. Evolutionary Computation, 7, 109-124
274. C. R. Stephens, H. Waelbroeck and R. Aguirre (1999) Schemata as building blocks: does size matter? In W. Banzhaf and CR. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, 117-134
275. P. D. Surry and NJ. Radcliffe (1996) Inoculation to initialise evolutionary search. In T. C. Fogarty (Ed.) (1996) Evolutionary Computing: AISB Workshop, Brighton, UK, April 1996; Selected Papers, Springer-Verlag, Berlin, 269-285
276. J. Suzuki (1997) A further result on the Markov chain model. In R. KBelew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA, 53-72
277. G. Syswerda (1989) Uniform crossover in genetic algorithms. In J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 2-9
278. D. Thierens (1997) Selection schemes, élitist recombination and selection intensity. In Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 152-159
279. C. Thornton (1995) Why GAs are Hard to Use. Cognitive Science Research Paper 399, School of Cognitive and Computing Sciences, University of Sussex, UK
280. C. A. Tovey (1997) Local improvement on discrete structures. Chapter 3 in E. Aarts and J. K. Lenstra (Eds.) (1997) Local Search in Combinatorial Optimization, John Wiley & Sons, Chichester
281. P. Turney, D. Whitley and R. Anderson (Eds.) (1997) The Baldwin Effect. Evolutionary Computation, 4. 3 (special issue)
282. H. Van Hove and A. Verschoren (1995) On epistasis. Computers and Artificial Intelligence, 14, 271-277
283. P. J. M. Van Laarhoven and E. H. L. Aarts (1988) Simulated Annealing: Theory and Applications. Kluwer, Dordrecht
284. E. Van Nimwegen, J. P. Crutchfield and M. Mitchell (1997) Finite populations induce metastability in evolutionary search. Physics Letters A, 229, 144-150
285. M. D. Vose (1991) Generalizing the notion of a schema in genetic algorithms. Artificial Intelligence, 50, 385-396
286. M. D. Vose and G. E. Liepins (1991) Schema disruption. In R. K. Belew and L. B. Booker (Eds.) (1991) Proceedings of 4th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 237-242
287. M. D. Vose (1993) Modeling simple genetic algorithms. In D. Whitley (Ed.) (1993) Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA, 63-74
288. M. D. Vose (1994) A closer look at mutation in genetic algorithms. Annals of Maths. and Artificial Intelligence, 10, 423-434
289. M. D. Vose and A. H. Wright (1994) Simple genetic algorithms with linear fitness Evolutionary Computation, 2, 347-368
290. M. D. Vose (1995) Modeling simple genetic algorithms. Evolutionary Computation, 3, 453-472
291. M. D. Vose and A. H. Wright (1995). Stability of vertex fixed points and applications. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 103-114
292. M. D. Vose and A. H. Wright (1998) The simple genetic algorithm and the Walsh Transform: Part I, Theory. Evolutionary Computation, 6, 253-273
293. M. D. Vose (1999) The Simple Genetic Algorithm: Foundations and Theory, MIT Press, Cambridge, MA
294. M. D. Vose (1999) What are genetic algorithms? A mathematical perspective. In L. D. Davis, K. A. De Jong, M. D. Vose and L. D. Whitley (Eds.) (1999) Evolutionary Algorithms: IMA Volumes in Mathematics and its Applications, Vol 111, Springer-Verlag, Ne w York, 251-276
295. M. D. Vose (1999) Random heuristic search. Theoretical Computer Science,229, 103-142
296. M. D. Vose and L. D. Whitley (1999) A formal language for permutation recombination operators. In W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, 135-146
297. M. D. Vose and A. H. Wright (2001) Form invariance and implicit parallelism. Evolutionary Computation, 9, 355-370
298. R. A. Watson, G. S. Hornby and J. B. Pollack (1998) Modeling building-block dependency. In A. E. Eiben, T. Bäck, M. Schoenauer, H. P. Schwefel (Eds.) Parallel Problem-Solving from Nature, 5, Springer-Verlag, Berlin, 97-106
299. B. Weber (1999) Irreducible complexity and the problem of biochemical emergence. Biology and Philosophy, 14, 593-605
300. E. D. Weinberger (1990) Correlated and uncorrelated landscapes and how to tell the difference. Biological Cybernetics, 63, 325-336
301. rd International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 116-121
302. D. Whitley (1991) Fundamental principles of deception in genetic search. In G. J. E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 221-241
303. D. Whitley, K. Mathias and P. Fitzhorn (1991) Delta coding: An iterative search strategy for genetic algorithms. In R. K. Belew and L. B. Booker (Eds.) (1991) Proceedings of 4th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, GA, 77-84
304. D. Whitley, T. Starkweather and D. Shaner (1991) The t r av e l in g salesman and sequence scheduling: Quality solutions using genetic edge recombination. In L. Davis (Ed.) (1991) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 350-372
305. D. Whitley(1992) Deception, dominance and implicit parallelism in genetic search. Annals of Mathematics and Artificial Intelligence, 5, 49-78
306. D. Whitley (1993) An executable model of a simple genetic algorithm. In L. D. Whitley (Ed.) (1993) Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA, 45-62
307. D. Whitley (1994) A genetic algorithm tutorial. Statistics and Computing, 4, 65-85
308. D. Whitley, V. S. Gordon and K. Mathias (1994) Lamarckian evolution, the Baldwin effect and function optimization. In Y. Davidor, H-P. Schwefel and R. Männer (Eds.) (1994) Parallel Problem-Solving from Nature, 3, Springer-Verlag, Berlin, 6-15
309. D. Whitley and N-W. Yoo (1995) Modeling permutation encodings in the simple genetic algorithm. In D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA, 163-184
310. D. Whitley and S. Rana (1997) Representation, search and genetic algorithms. In Proceedings of 14th National Conference on Artificial Intelligence (AAAI-97), AAAI Press, Menlo Park, CA, 497-502
311. D. Whitley (1999) A free lunch proof for Gray versus binary encodings. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Hanavar, M. Jakiela and R. E. Smith (Eds.) (1999) Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, San Francisco, CA, 726-733
312. D. Whitley, L. Barbulescu and J-P. Watson (2001) Local search and high precision Gray codes: Convergence results and neighborhoods. In W. N. Martin and W. M. Spears (Eds.) (2001) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco, CA, 295-311
313. S. W. Wilson (1991) GA-easy does not imply steepest-ascent optimiz-able. In R. K. Belew and L. B. Booker (Eds.) (1991) Proceedings of 4th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 85-89
314. D. H. Wolpert and W. G. Macready (1997) No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1, 67-82
315. A. H. Wright and G. Bidwell (1997) A search for counterexamples to two conjectures on the simple genetic algorithm. In R. K. Belew and M. D. Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Erancisco, CA, 73-84
316. A. H. Wright, R. K. Thompson and J. Zhang (2000) The computational complexity of N - K fitness functions. IEEE Transactions on Evolutionary Computation, 4, 373-379
317. A. H. Wright and A. Agapie (2001) Cyclic and chaotic behaviour in genetic algorithms. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H. -M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.) (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), Morgan Kaufmann, San Francisco, CA, 718-724
318. S. Wright (1932) The roles of mutation, inbreeding, crossbreeding and selection in evolution. In D. Jones (Ed.) (1932) Proceedings of the 6th International Congress on Genetics, 1, 356-366
319. F. Yates (1937) Design and Analysis of Factorial Experiments, Tech. Comm. No. 35, Imperial Bureau of Soil Sciences, London
320. G. Zweig (1995) An effective tour construction and improvement procedure for the traveling salesman problem. Operations Research, 43, 1049-1057
321. J. J. Grefenstette (Ed.) (1985) Proceedings of an International Conference on Genetic Algorithms and their applications. Lawrence Erlbaum Associates, Hillsdale, N J
322. J. J. Grefenstette (Ed.) (1987) Proceedings of the 2nd International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Hillsdale, N J
323. J. D. Schaffer (Ed.) (1989) Proceedings of 3rd International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA
324. R. K. Belew and L. B. Booker (Eds.) (1991) Proceedings of 4th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA
325. S. Forrest (Ed.) (1993) Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA
326. L. J. Eshelman (Ed.) (1995) Proceedings of 6th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA
327. Th. Bäck (Ed.) (1997) Proceedings of 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA.
328. W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Hanavar, M. Jakiela and R. E. Smith (Eds.) (1999) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), Morgan Kaufmann, San Francisco
329. D. Whitley, D. E. Goldberg, E. Cantú-Paz, L. Spector, I. Parmee, and H.-G. Beyer (Eds.) (2000) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), Morgan Kaufmann, San Francisco
330. L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.) (2001) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), Morgan Kaufmann, San Francisco, CA
331. P. J. Angeline (Ed.) (1999) Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Piscataway, N J
332. A. Zalzala (Ed.) (2000) Proceedings of the 2000 Congress on Evolutionary Computation, IEEE Press, Piscataway, N J
333. J-H. Kim (Ed.) (2001) Proceedings of the 2001 Congress on Evolutionary Computation, IEEE Press, Piscataway, N J
334. H-P. Schwefel and R. Männer (Eds.) (1991) Parallel Problem-Solving from Nature, Springer-Verlag, Berlin
335. R. Männer and B. Manderick (Eds.) (1992) Parallel Problem-Solving from Nature, 2, Elsevier Science Publishers, Amsterdam
336. Y. Davidor, H-P. Schwefel and R. Männer (Eds.) (1994) Parallel Problem-Solving from Nature, 3, Springer-Verlag, Berlin
337. H-M. Voigt, W. Ebeling, I. Rechenberg and H-P. Schwefel (Eds.) (1996) Parallel Problem-Solving from Nature, 4, Springer-Verlag, Berlin
338. A. E. Eiben, T. Bäck, M. Schoenauer, H-P. Schwefel (Eds.) (1998) Parallel Problem-Solving from Nature, 5, Springer-Verlag, Berlin
339. M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo and H-P. Schwefel (Eds.) (2000) Parallel Problem-Solving from Nature, 6, Springer-Verlag, Berlin
340. R. F. Albrecht, C. R. Reeves and N. C. Steele (Eds.) (1993) Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna
341. D. W. Pearson, N. C. Steele and R. F. Albrecht (Eds.) (1995) Proceedings of the 2nd International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna
342. G. D. Smith, N. C. Steele and R. F. Albrecht (Eds.) (1997) Proceedings of the 3rd International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna
343. A. Dobnikar, N. C. Steele, D. W. Pearson and R. F. Albrecht (Eds.) (1999) Proceedings of the 4th International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna
344. V. Kurkova, N. C. Steele, R. Neruda and M. Kárný (Eds.) (2001) Proceedings of the 5th International Conference on Artificial Neural Networks and Genetic Algorithms, Springer-Verlag, Vienna
345. G.J.E. Rawlins (Ed.) (1991) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA
346. L. D. Whitley (Ed.) (1993) Foundations of Genetic Algorithms 2, Morgan Kaufmann, San Mateo, CA
347. D. Whitley and M. Vose (Eds.) (1995) Foundations of Genetic Algorithms 3, Morgan Kaufmann, San Mateo, CA
348. R. K Belew and M. D Vose (Eds.) (1997) Foundations of Genetic Algorithms 4, Morgan Kaufmann, San Francisco, CA
349. W. Banzhaf and C. R. Reeves (Eds.) (1999) Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA
350. W. N. Martin and W. M. Spears (Eds.) (2001) Foundations of Genetic Algorithms 6, Morgan Kaufmann, San Francisco, CA