An overview of evolutionary computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 667 LNAI, Issue , 1993, Pages 442-459

  Spears, William M ^a   De Jong, Kenneth A ^b   Bäick, Thomas ^b   Fogel, David B ^b   De Garis, Hugo ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MACHINE LEARNING;

COMPUTATIONAL MODEL; COMPUTER-BASED PROBLEMS; DESIGN AND IMPLEMENTATIONS; EVOLUTIONARY PROCESS; KEY ELEMENTS;

PROBLEM SOLVING;

EID: 85028857450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56602-3_163     Document Type: Conference Paper

References (47)

1. Atmar, W. (1992) The philosophical errors that plague both evolutionary theory and simulated evolutionary programming. Proceedings of the First Annual Conference on Evolutionary Programming, 27-34. San Diego, CA: Evolutionary Programming Society.
2. Bäck, T., Hoffmeister, F., & Schwefel, H.-P. (1991) A survey of evolution strategies. Proceedings of the Fourth International Conference on Genetic Algorithms, 2-9. La Jolla, CA: Morgan Kaufmann.
3. Bäck, T., & Schwefel, H.-P. (1993) An overview of evolutionary algorithms for parameter optimization. Submitted to the Journal of Evolutionary Computation.
4. Belew, R. K., & Booker, L. B. (eds.) (1991) Proceedings of the Fourth International Conference on Genetic Algorithms. La Jolla, CA: Morgan Kaufmann.
5. Booker, L. B. (1992) Recombination distributions for genetic algorithms. Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.
6. Box, G. E. P. (1957) Evolutionary operation: a method of increasing industrial productivity. Applied Statistics, Vol. 6, 81-101.
7. Davis, L. (1989) Adapting operator probabilities in genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 60-69. La Jolla, CA: Morgan Kaufmann.
8. de Garis, H. (1990) Genetic programming: modular evolution for darwin machines. Proceedings of the 1990 International Joint Conference on Neural Networks, 194-197. Washington, DC: Lawrence Erlbaum.
9. De Jong, K. A. (1975) An analysis of the behavior of a class of genetic adaptive systems. Doctoral Thesis, Department of Computer and Communication Sciences. University of Michigan, Ann Arbor.
10. Jong, K. & Spears, W. (1991) Learning concept classification rules using genetic algorithms. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 651-656. Sydney, Australia: Morgan Kaufmann.
11. De Jong, K. A. (1992) Are genetic algorithms function optimizers? Proceedings of the Second International Conference on Parallel Problem Solving from Nature.
12. Eshelman, L. J., & Schaffer, J. D. (1991) Preventing premature convergence in genetic algorithms by preventing incest. Proceedings of the Fourth International Conference on Genetic Algorithms, 115-122. La Jolla, CA: Morgan Kaufmann.
13. Fbgel, L. J., Owens, A. J., & Walsh, M. J. (1966) Artificial Intelligence Through Simulated Evolution. New York: Wiley Publishing.
14. Fogel, D. B. (1992) An analysis of evolutionary programming. Proceedings of the First Annual Conference on Evolutionary Programming, 43-51. La Jolla, CA: Evolutionary Programming Society.
15. Fogel, D. B., & Atmar, J. W. (eds.) (1992) Proceedings of the First Annual Conference on Evolutionary Programming. La Jolla, CA: Evolutionary Programming Society
16. Fraser, A. S. (1957) Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Science, 10, 484-491.
17. Fujiko, C., & Dickinson, J. (1987) Using the genetic algorithm to generate LISP source code to solve the prisoner’s dilemma. Proceedings of the Second International Conference on Genetic Algorithms, 236-240. Cambridge, MA: Lawrence Erlbaum.
18. Goldberg, D. E. (1989a) Sizing populations for serial and parallel genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 70-79. Fairfax, VA: Morgan Kaufmann.
19. Goldberg, D. E. (1989b) Genetic Algorithms in Search, Optimization & Machine Learning. Reading, MA: Addison-Wesley.
20. Goldberg, D. E., Deb, K., & Korb, B. (1991) Don’t worry, be messy. Proceedings of the Fourth International Conference on Genetic Algorithms, 24-30. La Jolla, CA: Morgan Kaufmann.
21. Grefenstette, J. G., and Baker, J. E. (1989) How genetic algorithms work: a critical look at implicit parallelism. Proceedings of the Third International Conference on Genetic Algorithms, 20-27. Fairfax, VA: Morgan Kaufmann.
22. Grefenstette, John J. (1989) A system for learning control strategies with genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms, 183-190. Fairfax, VA: Morgan Kaufmann.
23. Grefenstette, J. G. (1992) Deception considered harmful. Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.
24. Harp, S. A., Samad, T., & Guha, A. (1991) Towards the genetic synthesis of neural networks. Proceedings of the Fourth International Conference on Genetic Algorithms, 360-369. La Jolla, CA: Morgan Kaufmann.
25. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: The University of Michigan Press.
26. Holland, J. (1986) Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. Michalski, J. Carbonell, T. Mitchell (eds.), Machine Learning: An Artificial Intelligence Approach. Los Altos: Morgan Kaufmann.
27. Janikow, C. (1991) Inductive learning of decision rules from attribute-based examples: A knowledge-intensive genetic algorithm approach. TR91-030, The University of North Carolina at Chapel Hill, Dept. of Computer Science, Chapel Hill, NC.
28. Koza, J. R. (1991) Evolving a computer program to generate random numbers using the genetic programming paradigm. Proceedings of the Fourth International Conference on Genetic Algorithms, 37-44. La Jolla, CA: Morgan Kaufmann.
29. Lipsitch, M. (1991) Adaptation on rugged landscapes generated by iterated local interactions of neighboring genes. Proceedings of the Fourth International Conference on Genetic Algorithms, 128-135. La Jolla, CA: Morgan Kaufmann.
30. Manderick, B., de Weger, M., & Spiessens, P. (1991) The genetic algorithm and the structure of the fitness landscape. Proceedings of the Fourth International Conference on Genetic Algorithms, 143-149. La Jolla, CA: Morgan Kaufmann.
31. Männer, R., & Manderick, B. (1992) Proceedings of the Second International Conference on Parallel Problem Solving from Nature, Amsterdam: North Holland.
32. Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) The distributed breeder genetic algorithm. Submitted to the Journal of Evolutionary Computation.
33. Rechenberg, I. (1973) Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog, Stuttgart.
34. Schaffer, J. D., Eshelman, L. J. (1991) On crossover as an evolutionarily viable strategy. Proceedings of the Fourth International Conference on Genetic Algorithms, 61-68. La Jolla, CA: Morgan Kaufmann.
35. Schaffer, J. D. & Morishima, A. (1987) An adaptive crossover distribution mechanisms for genetic algorithms. Proceedings of the Second International Conference on Genetic Algorithms, 36-40. Cambridge, MA: Lawrence Erlbaum.
36. Schraudolph, N. N., & Belew, R. K. (1992) Dynamic parameter encoding for genetic algorithms. Machine Learning Journal, Volume 9, Number 1, 9-22.
37. Schwefel, H.-P. (1981) Numerical Optimization of Computer Models. New York: John Wiley & Sons.
38. Shaefer, C. G. (1987) The ARGOT strategy: adaptive representation genetic optimizer technique. Proceedings of the Second International Conference on Genetic Algorithms, 50-58. Cambridge, MA: Lawrence Erlbaum.
39. Smith, S. (1983) Flexible learning of problem solving heuristics through adaptive search. Proceedings of the Eighth International Joint Conference on Artificial Intelligence, 422-425. Karlsruche, Germany: William Kaufmann.
40. Spears, W. M., and De Jong, K. A. (1991) On the virtues of uniform crossover. Proceedings of the Fourth International Conference on Genetic Algorithms, 230-236. La Jolla, CA: Morgan Kaufmann.
41. Spears, W. M. (1992a) Crossover or mutation? Proceedings of the Foundations of Genetic Algorithms Workshop, Vail, Colorado: Morgan Kaufmann.
42. Spears, W. M. (1992b) Adapting crossover in a genetic algorithm. Naval Research Laboratory AI Center Report AIC-92-025. Washington, DC 20375 USA.
43. Vose, M. D., & Liepins, G. E. (1991) Schema disruption. Proceedings of the Fourth International Conference on Genetic Algorithms, 237-242. La Jolla, CA: Morgan Kaufmann.
44. Whitley, D. (1989) The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. Proceedings of the Third International Conference on Genetic Algorithms, 116-121. Fairfax, VA: Morgan Kaufmann.
45. Whitley, D., Starkweather, T., & Fuquay, D. (1989) Scheduling problems and traveling salesmen: the genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms, 133-140. Fairfax, VA: Morgan Kaufmann.
46. Whitley, D., Mathias, K., & Fitzhorn, P. (1991) Delta coding: an iterative search strategy for genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, 77-84. La Jolla, CA: Morgan Kaufmann.
47. Whitley, D. (ed.) (1992) Proceedings of the Foundations of Genetic Algorithms Workshop. Vail, CO: Morgan Kaufmann.