An introduction to simulated evolutionary optimization

Evolutionary Computation: The Fossil Record

Volumn , Issue , 1998, Pages 3-14

  Fogel, David B ^a  

^a NATURAL SELECTION INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84992717699     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1109/9780470544600.ch1     Document Type: Chapter

References (144)

1. M. S. Bazaraa and C. M. Shetty, Nonlinear Programming, New York: John Wiley, 1979.
2. B. D. O. Anderson, R. R. Bitmead. C. R. Johnson, P. V. Kokotovic. R. L. Kosut, I. M. Y. Mareéis, L. Praly, and B. D. Riedle, Stability of Adaptive Systems: Passivity and Averaging Analysis. Cambridge, MA: MIT Press, 1986.
3. P. Werbos, “Beyond regression: new tools for prediction and analysis in the behavioral sciences," Doctoral dissertation, Harvard University, 1974.
4. D. E. Rumelhart and J. L. McClelland, Parallel Distributed Processing: Explorations in the Microstructures of Cognition, vol. I, Cambridge, MA: MIT Press, 1986.
5. L. Ljung, System Identification: Theory for the User, Englewood Cliffs, NJ: Prentice-Hall, 1987.
6. A. Hoffman, Arguments on Evolution: A Paleontologist’s Perspective, New York: Oxford University Press, 1988.
7. T. R. Malthus, An Essay on the Principle of Population, as it Affects the Future Improvement of Society, 6th ed., London: Murray, 1826.
8. E. Mayr, The Growth of Biological Thought: Diversity, Evolution and Inheritance, Cambridge, MA: Belknap Press, 1988.
9. J. Huxley, “The evolutionary process," in Evolution as a Process, J. Huxley, A. C. Hardy, and E. B. Ford, Eds. New York: Collier Books. pp. 9-33, 1963.
10. D. E. Wooldridge, The Mechanical Man: The Physical Basis of Intelligent Life. New York: McGraw-Hill, 1968.
11. W. Atmar, “The inevitability of evolutionary invention," unpublished manuscript, 1979.
12. S. Wright, “Evolution in Mendelian populations," Genetics, vol. 16, pp. 97-159, 1931.
13. S. Wright, “The evolution of life," Panel discussion in Evolution After Darwin: Issues in Evolution, vol. III, S. Tax and C. Callender, Eds. Chicago: Univ. of Chicago Press, 1960.
14. G. G. Simpson, The Meaning of Evolution: A Study of the History of life and Its Significance for Man. New Haven, CT: Yale Univ. Press, 1949.
15. T. Dobzhansky, Genetics of the Evolutionary Processes. New York: Columbia Univ. Press, 1970.
16. S. M. Stanley, “A theory of evolution above the species level," Proc. Nat. Acad. Sei., vol. 72, no. 2, pp. 646-650, 1975.
17. E. Mayr, “Where are we?" Cold Spring Harbor Symp. Quant. Biol, vol. 24, pp. 409-440, 1959.
18. E. Mayr, Animal Species and Evolution. Cambridge, MA: Belknap Press, 1963.
19. E. Mayr, Toward a New Philosophy of Biology: Observations of an Evolutionist. Cambridge, MA: Belknap Press, 1988.
20. R. Dawkins, The Blind Watchmaker. Oxford: Clarendon Press, 1986.
21. S. Wright, “The roles of mutation, inbreeding, crossbreeding, and selection in evolution," Proc. 6th Int. Cong. Genetics, Ithaca, vol. 1, pp. 356-366, 1932.
22. R. C. Lewontin, The Genetic Basis of Evolutionary Change. New York: Columbia University Press, NY, 1974.
23. P. H. Raven and G. B. Johnson, Biology, St. Louis, MO: Times Mirror, 1986.
24. A. S. Fräser, “Simulation of genetic systems by automatic digital computers. I. Introduction," Australian J. of Biol. Sei., vol. 10, pp. 484-491, 1957.
25. A. S. Fräser, “Simulation of genetic systems by automatic digital computers. JJ. Effects of linkage on rates of advance under selection," Australian J. of Biol. Sei., vol. 10, pp. 492-499, 1957.
26. A. S. Fräser, “Simulation of genetic systems by automatic digital computers. IV. Epistasis," Australian J. of Biol. Sei., vol. 13, pp. 329-346, 1960.
27. A. S. Fräser, “Simulation of genetic systems," J. ofTheor. Biol, vol. 2, pp. 329-346, 1962.
28. A. S. Fräser, “The evolution of purposive behavior," in Purposive Systems, H. von Foerster, J. D. White, L. J. Peterson, and J. K. Russell, Eds. Washington, DC: Spartan Books, pp. 15-23, 1968.
29. H. J. Bremermann, “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. of Washington, Seattle, 1958.
30. H. J. Bremermann, “Optimization through evolution and recombination," in Self-Organizing Systems. M. C. Yovits, G. T. Jacobi, and G. D. Goldstine, Eds. Washington, DC: Spartan Books, pp. 93-106, 1962.
31. H. J. Bremermann, “Quantitative aspects of goal-seeking self-organizing systems," in Progress in Theoretical Biology, vol. 1, New York: Academic Press, pp. 59-77, 1967.
32. H. J. Bremermann, “Numerical Optimization Procedures Derived from Biological Evolution Processes," in Cybernetic Problems in Bionics, H. L. Oestreicher and D. R. Moore, Eds. New York: Gordon & Breach, pp. 543-562, 1968.
33. H. J. Bremermann, “On the Dynamics and Trajectories of Evolution Processes," in Biogenesis, Evolution, Homeostasis. A. Locker, Ed. New York: Springer-Verlag, pp. 29-37, 1973.
34. H. J. Bremermann and M. Rogson, “An Evolution-Type Search Method for Convex Sets," ONR Technical Report, Contracts 222(85) and 3656(58), UC Berkeley, 1964.
35. H. J. Bremermann, M. Rogson, and S. Salaff, “Search by Evolution," in Biophysics and Cybernetic Systems. M. Maxfield, A. Callahan, and L. J. Fogel, Eds. Washington, DC: Spartan Books, pp. 157-167,1965.
36. H. J. Bremermann, M. Rogson, and S. Salaff, “Global Properties of Evolution Processes," in Natural Automata and Useful Simulations. H. Ii Pattee, E. A. Edlsack, L. Fein, and A. B. Callahan, Eds. Washington, DC: Spartan Books, pp. 3-41, 1966.
37. J. Reed, R. Toombs, and N. A. Barricelli, “Simulation of biological evolution and machine learning," Journal of Theoretical Biology, vol. 17, pp. 319-342, 1967.
38. J. H. Holland, “Adaptive plans optimal for payoff-only environments," Proc. of the 2nd Hawaii Int. Conf. on System Sciences, pp. 917-920, 1969.
39. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor Univ. Of Michigan Press, 1975.
40. K. A. De Jong, “The analysis of the behavior of a class of genetic adaptive systems," Doctoral dissertation, Univ. of Michigan, Ann Arbor, 1975.
41. N. N. Schraudolph and R. K. Belew, “Dynamic parameter encoding for genetic algorithms," Machine Learning, vol. 9, no. 1, pp. 9-21, 1992.
42. G. A. Vignaux and Z. Michalewicz, “A genetic algorithm for the linear transportation problem," IEEE Trans, on Systems, Man and Cybernetics, vol. 21, no. 2, pp. 445-452, 1991.
43. J. Antonisse, “A new interpretation of schema notation that overturns the binary encoding constraint," Proc. of the Third International Conf. on Genetic Algorithms, J. D. Schaffer, Ed. San Mateo, CA: Morgan Kaufmann Publishers, pp. 86-91, 1989.
44. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag, 1992.
45. D. J. Montana, “Automated parameter tuning for interpretation of synthetic images," in Handbook of Genetic Algorithms. L. Davis, Ed. New York: Van Nostrand Reinhold, pp. 282-311, 1991.
46. G. Syswerda, “Schedule optimization using genetic algorithms," in Handbook of Genetic Algorithms. L. Davis, Ed. New York: Van Nostrand Reinhold, pp. 332-349, 1991.
47. A. H. Wright “Genetic algorithms for real parameter optimization," Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann Publishers, pp. 205-218, 1991.
48. G. Rudolph, “Convergence properties of canonical genetic algorithms," IEEE Trans, on Neural Networks, vol. 5. no. 1, 1994.
49. J. J. Grefenstette, “Optimization of control parameters for genetic algorithms," IEEE Trans. Sys., Man and Cybern., vol. 16, no. 1, pp. 122-128, 1986.
50. A. E. Eiben, E. H. Aarts, and K. M. Van Hee, “Global convergence of genetic algorithms: An infinite Markov chain analysis," Parallel Problem Solving from Nature, H.-P. Schwefel and R. Mariner, Eds. Heidelberg, Berlin: Springer-Verlag, pp. 4-12, 1991.
51. D. B. Fogel, “Asymptotic convergence properties of genetic algorithms and evolutionary programming: Analysis and experiments," Cybernetics and Systems, in press, 1994.
52. L. Davis, Ed. Handbook of Genetic Algorithms, New York: Van Nostrand Reinhold, 1991.
53. D. E. Goldberg, “Computer-aided gas pipeline operation using genetic algorithms and rule learning," Doctoral dissertation, Univ. of Michigan, Ann Arbor, 1983.
54. J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht, “Genetic algorithms for the traveling salesman problem," in Proc. of an Intern. Conf. on Genetic Algorithms and Their Applications, J. J. Grefenstette, Ed. Lawrence Earlbaum, pp. 160-168, 1985.
55. G. Syswerda, “Uniform crossover in genetic algorithms," in Proc. of the Third Intern. Conf. on Genetic Algorithms. J. D. SchafFer, Ed. San Mateo, CA: Morgan Kaufmann, pp. 2-9, 1989.
56. A. S. Bickel and R. W. Bickel, “Determination of near-optimum use of hospital diagnostic resources using the ‘GENES’ genetic algorithm shell," Comput. Biol. Med., vol. 20, no. 1, pp. 1-13, 1990.
57. G. Pitney, T. R. Smith, and D. Greenwood, “Genetic design of processing elements for path planning networks," Proc. of the Int. Joint Conf. on Neural Networks 1990, vol. HI, IEEE, pp. 925-932, 1990.
58. N. N. Schraudolph, personal communication, UCSD, 1992.
59. J. H. Holland, “Genetic algorithms," Scientific American, pp. 66-72, July, 1992.
60. K. A. De Jong, “Are genetic algorithms function optimizers?" Proc. of the Sec. Parallel Problem Solving from Nature Conf., R. Männer and B. Manderick, Eds. The Netherlands: Elsevier Science Press, pp. 3-14,. 1992.
61. T. E. Davis and J. C. Principe, “A simulated annealing like convergence theory for the simple genetic algorithm," Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 174-181, 1991.
62. X. Qi and F. Palmieri, “Adaptive mutation in the genetic algorithm," Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D.B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 192-196, 1993.
63. G. E. Liepins and M. D. Vose, “Deceptiveness and genetic algorithm dynamics," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, pp. 36-52, 1991.
64. L. D. Whitley, “Fundamental principles of deception in genetic search," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, pp. 221-241, 1991.
65. W. E. Hart and R. K. Belew, “Optimizing an arbitrary function is hard for the genetic algorithm," Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 190-195, 1991.
66. S. Forrest and M. Mitchell, “What makes a problem hard for a genetic algorithm?" Machine Learning, vol. 13, no. 2-3, pp. 285-319, 1993.
67. J. D. Schaffer and L. J. Eshelman, “On crossover as an evolutionarily viable strategy," in Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 61-68, 1991.
68. W. M. Spears and K. A. De Jong, “On the virtues of parameterized uniform crossover," in Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 230-236, 1991.
69. D. E. Goldberg, K. Deb, and J. H. Clark, “Genetic algorithms: noise, and the sizing of populations," Complex Systems, vol. 6, pp. 333-362,1992.
70. V. Kreinovich, C. Quintana, and O. Fuentes, “Genetic algorithms-what fitness scaling is optimal," Cybernetics and Systems, vol. 24, no. 1, pp. 9-26, 1993.
71. S. W. Mahfoud and D. E. Goldberg, “Parallel recombinative simulated annealing: A genetic algorithm," IlliGAL Report No. 92002, Univ. of Illinois, Urbana-Champaign, 1992.
72. L. Ingber and B. Rosen, “Genetic algorithms and very fast simulated annealing-a comparison," Math, and Comp. Model., vol. 16, no. 11, pp. 87-100, 1992.
73. D. Adler, “Genetic algorithms and simulated annealing: A marriage proposal," in IEEE Conference on Neural Networks 1993, pp. 1104-1109, 1993.
74. J. R. Koza, “A hierarchical approach to learning the boolean multiplexer function," in Foundations of Genetic Algorithms. G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, pp. 171-192, 1991.
75. J. R. Koza, Genetic Programming. Cambridge, MA: MTT Press, 1992.
76. S. Forrest and G. Mayer-Kress, “Genetic algorithms, nonlinear dynamical systems, and models of international security," Handbook of Genetic Algorithms, L. Davis, Ed. New York: Van Nostrand Reinhold, pp. 166-185, 1991.
77. J. R. Koza, “Hierarchical automatic function definition in genetic programming," Foundations of Genetic Algorithms 2, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, pp. 297-318, 1992.
78. K. Kristinsson and G. A. Dumont, “System identification and control using genetic algorithms," IEEE Trans. Sys., Man and Cybern., vol. 22, no. 5, pp. 1033-1046. 1992.
79. K. Krishnakumar and D. E. Goldberg, “Control system optimization using genetic algorithms," Journ. of Guidance, Control and Dynamics, vol. 15, no. 3, pp. 735-740, 1992.
80. J. H. Holland, “Concerning the emergence of tag-mediated lookahead in classifier systems," Physica D, vol. 42, pp. 188-201, 1990.
81. S. Forrest and J. H. Miller, “Emergent behavior in classifier systems," Physica D, vol. 42, pp. 213-227, 1990.
82. R. L. Riolo, “Modeling simple human category learning with a classifier system," in Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 324-333, 1991.
83. G. E. Liepins, M. R. Hilliard, M. Palmer and G. Rangarajan, “Credit assignment and discovery in classifier systems," Intern. Journ. of Intelligent Sys., vol. 6, no. I, pp. 55-69, 1991.
84. S. Tokinaga and A.B. Whinston, “Applying adaptive credit assignment algorithms for the learning classifier system based upon the genetic algorithm," IE1CE Trans, on Fund. Elec. Comm. and Comp. Sei., vol. E75A, no. 5, pp. 568-577, 1992.
85. D. Jefferson, R. Collins, C. Cooper, M. Dyer, M. Flowers, R. Korf, C. Taylor, and A. Wang, “Evolution as a theme in artificial life: The Genesys/Tracker system," in Artificial Life II, C. G. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen, Eds. Reading, MA: Addison-Wesley, pp. 549-578, 1991.
86. J. H. Holland, Adaptation in Natural and Artificial Systems. 2nd ed., Cambridge, MA: MTT Press, 1992.
87. H. Mühlenbein, “Evolution in time and space-the parallel genetic algorithm," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, pp. 316-337, 1991.
88. P. Spiessens and B. Manderick, “A massively parallel genetic algorithm: implementation and first analysis," in Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA: Morgan Kaufmann, pp. 279-286, 1991.
89. H. MUhlenbein, M. Schomisch and J. Bom, “The parallel genetic algorithm as function optimizer," Parallel Computing, vol. 17, pp. 619-632. 1991.
90. S. Forrest, Ed., Proc. of the Fifth Intern. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1993.
91. H.-P. Schwefel, “Kybernetische evolution als Strategie der experimentellen forschung in der strmungstechnik," Diploma thesis, Technical Univ. of Berlin, 1965.
92. I. Rechenberg, Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biolgischen evolution. Stuttgart: Frommann-Holzboog Verlag, 1973.
93. L. J. Fogel, “Autonomous automata," Industrial Research, vol. 4, pp. 14-19, 1962.
94. L. J. Fogel, “On the organization of intellect," Doctoral dissertation, UCLA, 1964.
95. M. Conrad, “Evolutionary learning circuits," Journ. Theor. Biol., vol. 46. pp. 167-188. 1974.
96. M. Conrad and H. H. Partee, “Evolution experiments with an artificial ecosystem," Journ. Theor. Biol., vol. 28, pp. 393-409, 1970.
97. G. H. Bürgin, “On playing two-person zero-sum games against nonmin¬imax players," IEEE Trans, on Systems Science and Cybernetics, vol. SSC-5, no. 4, pp. 369-370, 1969.
98. G. H. Bürgin, “System identification by quasilinearization and evolutionary programming," Journal of Cybernetics, vol. 2, no. 3, pp. 4-23, 1974.
99. J. W. Atmar, “Speculation on the evolution of intelligence and its possible realization in machine form," Doctoral dissertation, New Mexico State University, Las Cruces, 1976.
100. D. B. Fogel, “On the philosophical differences between genetic algorithms and evolutionary algorithms," in Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 23-29, 1993.
101. F. J. Solis and R. J.-B. Wets, “Minimization by random search techniques," Math. Operations Research, vol. 6, pp. 19-30, 1981.
102. T. Bäck and H.-P. Schwefel, “An Overview of Evolutionary Algorithms for Parameter Optimization," Evolutionary Computation, vol. 1, no. 1, pp. 1-24, 1993.
103. H.-P. Schwefel, “Numerische Optimierung von computer-modellen mittels der evoluionsstrategie," Interdisciplinary systems research, vol. 26, Basel: Birkhuser, 1977.
104. H.-P. Schwefel, Numerical Optimization of Computer Models. Chichester, UK: John Wiley, 1981.
105. G. H. Mealy, “A method of synthesizing sequential circuits," Bell Sys. Tech. Journ., vol. 34, pp. 1054-1079, 1955.
106. D. B. Fogel, ‘The evolution of intelligent decision making in gaming," Cybernetics and Systems, vol. 22, pp. 223-236, 1991.
107. D. B. Fogel, “Evolving behaviors in the iterated prisoner’s dilemma," Evolutionary Computation, vol. 1, no. 1, pp. 77-97, 1993.
108. R. Axelrod, “The evolution of strategies in the iterated prisoner’s dilemma," in Genetic Algorithms and Simulated Annealing, L. Davis, Ed. London: Pitman Publishing, pp. 32-41, 1987.
109. D. B. Fogel, L. J. Fogel, and W. Atmar, “Meta-evolutionary programming," in Proc. of the 25th Asilomar Conf. on Signals, Systems and Computers, R. R. Chen, Ed. IEEE Computer Society, pp. 540-545, 1991.
110. D. B. Fogel, L. J. Fogel, W. Atmar, and G. B. Fogel, “Hierarchic methods of evolutionary programming," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 175-182, 1992.
111. T. Bäck, G. Rudolph, and H.-P. Schwefel, “Evolutionary prognuruning and evolution strategies: similarities and differences," in Proc. of the Second Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 11-22, 1993.
112. N. Saravanan, “Learning of Strategy Parameters in Evolutionary Pro¬gramming," Proc. of Third Annual Conference on Evolutionary Programming. A. V. Sebald and L. J. Fogel, Eds. RiverEdge, NJ: World Scientific, to appear, 1994.
113. G. Rudolph, “On correlated mutations in evolution strategies," in Parallel Problem Solving from Nature 2, R. Männer and B. Manderick, Eds. The Netherlands: Elsevier Science Press, pp. 105-114, 1992.
114. B. K. Ambati, J. Ambati, and M. M. Mokhtar, “Heuristic combinatorial optimization by simulated darwinian evolution: A polynomial time algorithm for the traveling salesman problem," Biological Cybernetics, vol. 65. pp. 31-35. 1991.
115. D. B. Fogel. “Empirical estimation of the computation required to discover approximate solutions to the traveling salesman problem using evolutionary programming," in Proc. of the Second Ann. Conf. on Evolutionary Programming. D. B. Fogel and W. Atmar, Eds. La Jolla. CA: Evolutionary Programming Society, in press, 1993.
116. D. Waagen, P. Diercks, and J. R. McDonnell, “The stochastic direction set algorithm: A hybrid technique for finding function extrema," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 35-42, 1992.
117. R. Lohmann, “Structure evolution and incomplete induction," in Proc. of the Sec. Parallel Problem Solving from Nature Conf., R. Manner and B. Manderick, Eds. The Netherlands: Elsevier Science Press, pp. 175-186, 1992.
118. J. R. McDonnell and D. Waagen, “Evolving neural network connectivity," Intern. Conf. on Neural Networks 1993. IEEE, pp. 863-868, 1993.
119. P. J. Angeline, G. Saunders and J. Pollack, “An evolutionary algorithm that constructs neural networks," IEEE Trans. Neural Networks, vol. 5, no 1, 1994.
120. D. B. Fogel, “Using evolutionary programming to create neural networks that are capable of playing tic-tac-toe," Inern. Conf. on Neural Networks 1993, WEE, pp. 875-880, 1993.
121. R. Smalz and M. Conrad, “Evolutionary credit apportionment and time-dependent neural processing," in Proc. of the Second Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 119-126, 1993.
122. W. Kuhn and A. Visser, “Identification of the system parameter of a 6 axis robot with the help of an evolution strategy," Robotersystème, vol. 8, no. 3, pp. 123-133, 1992.
123. J. R. McDonnell, B. D. Andersen, W. C. Page and F. Pin, “Mobile manipulator configuration optimization using evolutionary programming," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 52-62, 1992.
124. W. C. Page, B. D. Andersen, and J. R. McDonnell, “An evolutionary programming approach to multi-dimensional path planning," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 63-70, 1992.
125. A. V. Sebald, J. Schlenzig, and D. B. Fogel, “Minimax design of CM AC encoded neural controllers for systems with variable time delay," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 120-126, 1992.
126. D. B. Fogel, System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling. Needham, MA: Ginn Press, 1991.
127. D. B. Fogel, “Using evolutionary programming for modeling: An ocean acoustic example," IEEE Journ. on Oceanic Engineering, vol. 17, no. 4, pp. 333-340, 1992.
128. V. W. Porto, “Alternative methods for training neural networks," in Proc. of the First Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 100-110, 1992.
129. L. A. Tamburino, M. A. Zmuda and M. M. Rizki, “Applying evolutionary search to pattern recognition problems," in Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. Evolutionary Programming Society, La Jolla, CA, pp. 183-191,1993.
130. M. M. Rizki, L. A. Tamburino and M. A. Zmuda, “Evolving multi-resolution feature detectors," in Proc. of the Sec. Ann. Conf. on Evolu- tionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 108-118, 1993.
131. D. B. Fogel and P. K. Simpson, “Evolving fuzzy clusters," Intern. Conf. on Neural Networks 1993, IEEE, pp. 1829-1834, 1993.
132. S. Haffher and A. V. Sebald, “Computer-aided design of fuzzy HVAC controllers using evolutionary programming," in Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 98-107, 1993.
133. S. H. Rubin, “Case-based learning: A new paradigm for automated knowledge acquisition," ISA Transactions, Special Issue on Artif. Intell. for Eng., Design and Manuf., vol. 31, pp. 181-209, 1992.
134. W. Atmar, “Notes on the simulation of evolution," IEEE Trans, on Neural Networks, vol. 5. no. I, 1994.
135. G. B. Fogel, “An introduction to the protein folding problem and the potential application of evolutionary programming," in Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D. B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 170-177, 1993.
136. M. Conrad, “Molecular computing: The lock-key paradigm," Computer, Special Issue on Molecular Computing, M. Conrad, Ed. Nov., pp. 11-20, 1992.
137. J. O’CaDaghan and M. Conrad, “Symbiotic interactions in the EVOLVE m ecosystem model," BioSystems, vol. 26, pp. 199-209, 1992.
138. G. Rudolph, “Parallel approaches to stochastic global optimization," in Parallel Computing: From Theory to Sound Practice. W. Joosen and E. Milgrom. Eds. Amsterdam: IOS Press pp. 256-267, 1992.
139. B. S. Duncan, “Parallel evolutionary programming," in Proc. of the Sec. Ann. Conf. on Evolutionary Programming, D.B. Fogel and W. Atmar, Eds. La Jolla, CA: Evolutionary Programming Society, pp. 202-208, 1993.
140. F. Hoffmeister, “Scalable Parallelism by Evolutionary Algorithms," in Parallel Comp. & Math. Opt., D. B. Grauer, Ed. Heidelberg, Berlin: Springer-Verlag, pp. 177-198, 1991.
141. D. B. Fogel and W. Atmar Eds. Proc. of the Sec. Ann. Conf. on Evolutionary Programming, La Jolla, CA: Evolutionary Programming Society, 1993.
142. R. Männer and B. Manderick, Eds., Proc. of the Sec. Parallel Problem Solving from Nature Conf. The Netherlands: Elsevier Science Press, 1992.
143. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison Wesley, 1989.
144. L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence through Simulated Evolution. New York: John Wiley, 1966.