Unearthing a Fossil from the History of Evolutionary Computation

Fundamenta Informaticae

Volumn 35, Issue 1-4, 1998, Pages 1-16

  Fogel, David B ^a  

^a NATURAL SELECTION INC   (United States)

Author keywords

Evolutionary algorithms; History of evolutionary computation

Indexed keywords

EID: 0346906090     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-35123401     Document Type: Article

References (69)

1. P.J. Angeline (1997) "Subtree crossover: Building block engine or macromutation?" Genetic Programming 1997: Proceedings of the 2nd Ann. Conf., J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo (eds.), Morgan Kaufmann, San Francisco, CA, pp. 9-17.
2. P.J. Angeline, R.G. Reynolds, J.R. McDonnell, and R. Eberhart (eds.) (1997) Evolutionary Programming VI: Proceedings of the 6th Ann. Conf. on Evolutionary Programming, Springer-Verlag, Berlin.
3. R. Axelrod (1987) "The evolution of strategies in the iterated prisoner's dilemma," Genetic Algorithms and Simulated Annealing, L. Davis (ed.), Pitman, London, pp. 32-41.
4. T. Bäck and H.-P. Schwefel (1993) "An overview of evolutionary algorithms in parameter optimization," Evolutionary Computation, Vol. 1:1, pp. 1-24.
5. J.S.F. Barker (1958) "Simulation of genetic systems by automatic digital computers. III. Selection between alleles at an autosomal locus," Australian J. Biological Sciences, Vol. 11 pp. 603-612.
6. N.A. Barricelli (1954) "Esempi numerici di processi di evoluzione," Methodos, pp. 45-68.
7. N.A. Barricelli (1963) "Numerical testing of evolution theories. Part II: Preliminary tests of performance, symbiogenesis and terrestrial life," Acta Biotheoretica Vol. 16 No 3-4, pp. 99-126.
8. W. Bossert (1967) "Mathematical optimization: are there abstract limits on natural selection," Mathematical Challenges to the Neo-Darwinian Interpretation of Evolution, P.S. Moorhead and M.M. Kaplan (eds.), The Wistar Institute Press, Philadelphia, PA, pp. 35-46.
9. G.E.P. Box (1957) "Evolutionary operation: A method for increasing industrial productivity," Applied Statistics, Vol. 6:2, pp. 81-101.
10. H.J. Bremermann (1958) "The evolution of intelligence. The nervous system as a model of its environment," Technical Report, No. 1, Contract No. 477(17), Dept. of Mathematics, Univ. Washington, Seattle, July.
11. H.J. Bremermann (1962) "Optimization through evolution and recombination," Self-Organizing Systems-1962, M.C. Yovits, G.T. Jacobi, and G.D. Goldstein (eds.), Spartan Books, Washington D.C., pp. 93-106.
12. H.J. Bremermann (1967) "Quantitative aspects of goal-seeking self-organizing systems," Progress in Theoretical Biology, Vol. 1, Academic Press, NY, pp. 59-77.
13. H.J. Bremermann (1968) "Numerical optimization procedure derived from biological evolution processes," Cybernetic Problems in Bionics, H.L. Oestreicher and D.R. Moore (eds.), Bionics Symposium 1966, Dayton, OH, Gordon and Breach, NY, pp. 543-561.
14. H.J. Bremermann (1970) "A method of unconstrained global optimization," Math. Biosciences, Vol. 9, pp. 1-15.
15. H.J. Bremermann (1973) "On the dynamics and trajectories of evolution processes," Biogenesis, Evolution, Homeostasis, A. Locker (ed.), Springer-Verlag, NY, pp. 29-37.
16. H.J. Bremermann and M. Rogson (1964) "An evolution-type search method for convex sets," ONR Tech. Report, Contracts 222(85) and 3656(58), Berkeley, CA, May.
17. H.J. Bremermann, M. Rogson, and S. Salaff (1965) "Search by evolution," Biophysics and Cybernetic Systems, M. Maxfield, A. Callahan, and L.J. Fogel (eds.), Spartan Books, Washington D.C., pp. 157-167.
18. H.J. Bremermann, M. Rogson, and S. Salaff (1966) "Global properties of evolution processes," Natural Automata and Useful Simulations, H.H. Pattee, E.A. Edlsack, L. Fein, and A.B. Callahan (eds.), Spartan Books, Washington D.C., pp. 3-41.
19. G.H. Burgin (1969) "On playing two-person zero-sum games against nonminimax players," IEEE Trans. Systems Science and Cybern., Vol. SSC-5, pp. 369-370.
20. K. Chellapilla (1997) "Evolving computer programs without subtree crossover," IEEE Trans. Evolutionary Computation, Vol. 1:3, pp. 209-216.
21. M. Conrad and H.H. Pattee (1970) "Evolution experiments with an artificial ecosystems," J. Theoret. Biol., Vol. 28, pp. 393-409.
22. J.L. Crosby (1963) "Evolution by computer," New Scientist, Vol. 17, pp. 415-417.
23. L. Davis (1991) "Bit-climbing, representational bias, and test suite design," Proc. of the 4th Intern. Conf. on Genetic Algorithms, R.K. Belew and L.B. Booker (eds.), Morgan Kaufmann, San Mateo, CA, pp. 18-23.
24. K.A. De Jong (1975) "An analysis of the behavior of a class of genetic adaptive systems," Doctoral dissertation, Univ. Michigan, Ann Arbor.
25. R.A. Fisher (1930) The Genetical Theory of Natural Selection, Clarendon Press, Oxford.
26. D.B. Fogel (1988) "An evolutionary approach to the traveling salesman problem," Biological Cybernatics, Vol. 6:2, pp. 139-144.
27. D.B. Fogel (ed.) (1998) Evolutionary Computation: The Fossil Record, IEEE Press, Piscataway, NJ, in press.
28. D.B. Fogel and J.W. Atmar (1990) "Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems," Biological Cybernetics, Vol. 63:2 pp. 111-114.
29. D.B. Fogel and L.C. Stayton (1994) "On the effectiveness of crossover in simulated evolutionary optimization," BioSystems, Vol. 32:3, pp. 171-182.
30. D.B. Fogel and A. Ghozeil (1997a) "A note on representations and variation operators," IEEE Trans. Evolutionary Computation, Vol. 1:2, pp. 159-161.
31. D.B. Fogel and A. Ghozeil (1997b) Schema processing under proportional selection in the presence of random effects," IEEE Trans. Evolutionary Computation, Vol. 1:4, pp.290-293.
32. L.J. Fogel (1962) "Autonomous automata," Industrial Research, Vol. 4, pp. 14-19.
33. L.J. Fogel, "On the organization of intellect," Doctoral Dissertation, UCLA, 1964.
34. L.J. Fogel and G-H. Burgin (1969) "Competitive goal-seeking through evolutionary programming," Final Report under Contract No. AF 19(628)-5927, Air Force Cambridge Research Labs.
35. L.J. Fogel, A.J. Owens and M.J. Walsh (1965) "Artificial intelligence through a simulation of evolution," Biophysics and Cybernetic Systems: Proc. of the 2nd Cybernetic Sciences Symposium, M. Maxfield, A. Callahan, and L.J. Fogel (eds.), Spartan Books, Washington D.C., pp. 131-155.
36. L.J. Fogel, A.J. Owens, and M.J. Walsh (1966) Artificial Intelligence through Simulated Evolution, John Wiley, NY.
37. A.S. Fraser (1957a) "Simulation of genetic systmes by automatic digital computers. I. Introduction," Australian J. Biological Sciences, Vol. 10, pp. 484-491.
38. A.S. Fraser (1957b) "Simulation of genetic systems by automatic digital computers. II. Effects of linkage of rates of advance under selection," Australian J. Biological Sciences, Vol. 10, pp. 492-499.
39. A.S. Fraser (1960a) "Simulation of genetic systems by automatic digiatl computers, 5-linkage, dominance and epistasis," Biometrical Genetics, O. Kempthorne (ed.), Pergamon Press, NY, pp. 70-83.
40. A.S. Fraser (1960b) "Simulation of genetic systems by automatic digital computers. VI. Epistasis," Australian J. Biological Cybernetics, Vol. 13:2, pp. 150-162.
41. A.S. Fraser (1960c) "Simulation of genetic systems by automatic digital computers. VII. Effects of reproductive rate, and intensity of selection, on genetic structure," Australian J. Biological Sciences, Vol. 13, pp. 344-350.
42. A.S. Fraser (1962) "Simulation of genetic systems," J. Theo. Biol., Vol. 2, pp. 329-346.
43. A.S. Fraser and D. Burnell (1967a) "Simulation of genetic systems. XI. Inversion polymorphism," Am. J. of Human Genetics, Vol. 19:3, pp. 270-287.
44. A.S. Fraser and D. Burnell (1967b) "Simulation of genetic systems. XII. Models of inverstion polymorphism," Genetics, Vol. 57, pp. 267-282.
45. A.S. Fraser (1968) "The evolution of purposive behavior," Purposive Systems, H. von Foerster, J.D. White, L.J. Peterson, and J.K. Russell (eds.), Spartan Books, Washington D.C., pp. 15-23.
46. A.S. Fraser and D. Burnell (1970) Computer Models in Genetics, McGraw-Hill, NY.
47. R.M. Friedberg (1958) "A learning machine: Part I," IBM J. Research and Development, Vol. 2:1, pp. 2-13.
48. G.F. Friedman (1956) "Selective feedback computers for engineering synthesis and nervous system analogy," Master's thesis, UCLA.
49. D.E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
50. D.E. Goldberg and R. Lingle (1985) "Alleles, loci, and the traveling salesman problem," Proc. of an Intern. Conf. on Genetic Algorithms and Their Applications, J.J. Grefenstette (ed.), Lawrence Erlbaum, Hillsdale, NJ, pp. 154-159.
51. J. A. Goguen and N.H. Goguen (1967) "Contributions to the mathematical theory of evolutionary algorithms," ONR Tech. Report, Contracts 3656(08) and 222(85), Berkely, CA, Sept.
52. J.H. Holland (1975) Adaptation in Natural and Artificial Systems, Univ. Michigan Press, Ann Arbor.
53. J.H. Holland (1997) Personal communication, plenary lecture, 7th International Conference on Genetic Algorithms, East Lansing, MI.
54. H. Kaufman (1967) "An experimental investigation of process identification by competitive evolution," IEEE Trans. Systems Science and Cybernetics, Vol. SSC-3:1, pp. 1-16.
55. S. Levy (1992) Artificial Life: A Report from the Frontier where Computers Meet Biology, Vintage, NY.
56. W.G. Macready and D.H. Wolpert (1996) "On 2-armed Gaussian bandits and optimization," Tech. report, SFI-TR-96-03-009, Santa Fe Institute, Santa Fe, NM.
57. M. Mitchell (1996) An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA.
58. V.W. Porto, N. Saravanan, D.E. Waagen, and A.E. Eiben (eds.) (1998) Evolutionary Programming VII: Proceedings of the 7th Ann. Conf. on Evolutionary Programming, Springer-Verlag, Berlin.
59. I. Rechenberg (1965) "Cybernetic solution path of an experimental problem," Royal Aircraft Establishment, Library Translation 1122.
60. I. Rechenberg (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog, Stuttgart, Germany.
61. J. Reed, R. Toombs, and N.A. Barricelli (1967) "Simulation of biological evolution and machine learning: I. Selection of self-reproducing numeric patterns by data processing machines, effects of hereditary control, mutation type and crossing," J. Theo. Biol., Vol. 17, pp. 319-342.
62. G. Rudolph (1997) "Reflections on bandit problems and selection methods in uncertain environments," Proc. of the 7th Intern. Conf. on Genetic Algorithms, T. Bäck (ed.), Morgan Kaufmann, San Francisco, CA, pp. 166-173.
63. R. Salomon (1996) "Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms," BioSystems, Vol. 39, pp. 263-278.
64. J.D. Schaffer and L. Eshelman (1991) "On crossover as an evolutionary viable strategy," Proc. of the Fourth International Conference on Genetic Algorithms, R.K. Belew and L.B. Booker (eds.), Morgan Kaufmann, San Mateo, CA, pp. 61-68.
65. H.-P. Schwefel (1981) Numerical Optimization of Computer Models, John Wiley, Chichester, U.K.
66. H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel (eds.) (1996) Parallel Problem Solving from Nature IV, Springer-Verlag, Berlin.
67. M.M. Waldrop (1992) Complexity: The Emerging Science at the Edge of Order and Chaos, Simon and Schuster, NY.
68. D. Whitley and T. Hanson (1989) "Optimizing neural networks using faster, more accurate genetic search," Proc. of the 3rd Int. Conf. on Genetic Algorithms, J.D. Schaffer (ed.), Morgan Kaufmann, San Mateo, CA, pp. 391-396.
69. D.H. Wolpert and W.G. Macready (1997) "No free lunch theorems for optimization," IEEE Trans. Evolutionary Computation, Vol. 1:1, pp. 67-82.