Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusions
References

Evolutionary computation: an overview

Profile image of Melanie MitchellMelanie Mitchell

1999

Abstract

Evolutionary computation is an area of computer science that uses ideas from biological evolution to solve computational problems. Many such problems require searching through a huge space of possibilities for solutions, such as among a vast number of possible hardware circuit layouts for a configuration that produces desired behavior, for a set of equations that will predict the ups and downs of a financial market, or for a collection of rules that will control a robot as it navigates its environment.

Related papers

The Evolutionary Computation (EC)
Jason Benskin

The topic of evolution has been a subject of much heated debate over time but up to now the evidences pointing to the authenticity of evolution as a natural process cannot be ignored. Evolution can also be understandable by looking at it in terms of the process of Natural Selection first elucidated by Darwin. At its core, natural selection means that nature will favor those species with traits that aid its survival. In this sense, species with weaker traits or lacking the ability to adapt to the tides of nature will die off, leaving stronger species with more dominant traits to move forward and evolve further.

View PDFchevron_right
New Trends in Evolutionary Computation
Peter J Bentley

… , 2001. Proceedings of …, 2001

In the last five years, the field of evolutionary computation (EC) has seen a resurgence of new ideas, many stemming from new biological inspirations. This paper outlines four of these new branches of research: Creative Evolutionary Systems, Computational Embryology, Evolvable Hardware and Artificial Immune Systems, showing how they aim to extend the capabilities of EC. Recent, unpublished results by researchers in each area at the Department of Computer Science, UCL are provided.

View PDFchevron_right
Prospects for Computational Steering of Evolutionary Computation
John Cartlidge

2002

Currently, evolutionary computation (EC) typically takes place in batch mode: algorithms are run au- tonomously, with the user providing little or no interven- tion or guidance. Although it is rarely possible to specify in advance, on the basis of EC theory, the optimal evo- lutionary algorithm for a particular problem, it seems likely that experienced EC practitioners possess consid- erable

View PDFchevron_right
Genetic algorithms+ data structures= evolution programs
Zbigniew Michalewicz

third extended revised edition, Springer Verlag …, 1999

The field now called Evolutionary Computation had a slow start. In the late 60s and early 70s a number of researchers in the USA and Germany applied the principles of Darwinian evolution, based on natural selection, for problem solving. Independently from each other they established the power of evolutionary techniques and worked on the theory and applications of their own approach. These were the times of rather separate development of Genetic Algorithms, Evolution Strategies and Evolutionary Programming. From the early 90s it is more and more acknowledged that the different approaches share the same basic principles, while differing only in technical details, terminology and sometimes in the philosophy behind it. In the meanwhile, a new branch, called Genetic Programming, has also emerged and joined the family. The entire family of algorithms is called nowadays the family of Evolutionary Algorithms-a name attempting to cover all the aforementioned techniques, and even more. An Evolutionary Algorithm (EA) can actually be any population-based, stochastic search algorithm that uses a (heuristic) quality measure, called fitness, of candidate solutions and applies reproduction operators to create, and fitness-based selection to reduce, diversity in the population.

View PDFchevron_right
Applications of Evolutionary Computation
Carlos Cotta

The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

View PDFchevron_right
Understanding evolutionary computing: A hands on approach
Trevor Collins

1998

Abstract Evolutionary computing is the study of robust search algorithms based on the principles of evolution. An evolutionary algorithm (EA) searches a problem space in order to find regions containing good solutions. Typically EA users judge the quality of their algorithms by the quality of the solutions found. This approach ignores the behavior of the search algorithm and concentrates solely on the outcome. As a result, the user is unaware of their algorithm's actions or how the solutions were discovered.

View PDFchevron_right
Evolutionary and Bio-Inspired Computation: Theory and Applications IV
Kevin Priddy (EXT)

2010

The papers included in this volume were part of the technical conference cited on the cover and title page. Papers were selected and subject to review by the editors and conference program committee. Some conference presentations may not be available for publication. The papers published in these proceedings reflect the work and thoughts of the authors and are published herein as submitted. The publisher is not responsible for the validity of the information or for any outcomes resulting from reliance thereon.

View PDFchevron_right
On the state of evolutionary computation
William Spears, Kenneth De Jong

Proceedings of the Fifth International Conference …, 1993

View PDFchevron_right
Evolutionary computation: comments on the history and current state
Hans-Paul Schwefel

IEEE Transactions on Evolutionary Computation, 1997

Evolutionary computation has started to receive significant attention during the last decade, although the origins can be traced back to the late 1950's. This article surveys the history as well as the current state of this rapidly growing field. We describe the purpose, the general structure, and the working principles of different approaches, including genetic algorithms (GA) [with links to genetic programming (GP) and classifier systems (CS)], evolution strategies (ES), and evolutionary programming (EP) by analysis and comparison of their most important constituents (i.e., representations, variation operators, reproduction, and selection mechanism). Finally, we give a brief overview on the manifold of application domains, although this necessarily must remain incomplete.

View PDFchevron_right
Real-World Applications of Evolutionary Computing
Terence Fogarty

Springer eBooks, 2000

View PDFchevron_right

References (79)

  1. Ackley D, Littman M. 1992. Interactions between learning and evolution. In Artifi- cial Life II, ed. CG Langton, C Taylor, JD Farmer, S Rasmussen, pp. 487-509. Read- ing, MA: Addison-Wesley
  2. Adami C. 1998. Introduction to Artificial Life. New York: Springer-Verlag
  3. Angeline PJ, ed. 1997. Evolutionary Pro- gramming VI: 6th Int. Conf. EP97. New York: Springer
  4. Arita T, Koyama Y. 1998. Evolution of lin- guistic diversity in a simple communication system. In Artificial Life VI, ed. C Adami, RK Belew, H Kitano, CE Taylor, pp. 9-17. Cambridge, MA: MIT Press
  5. Axelrod R. 1984. The Evolution of Cooper- ation. New York: Basic
  6. Bäck T. 1996. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algo- rithms. Oxford: Oxford Univ. Press
  7. Bäck T, ed. 1997. Proceedings of the Seventh International Conference on Genetic Algo- rithms, San Francisco, CA: M. Kaufmann
  8. Baeck T, Hammel U, Schwefel HP. 1997. Evolutionary computation: comments on ? the history and current state. IEEE Trans. Evol. Computation 1:3-17
  9. Bak P. 1996. How Nature Works: The Science of Self-Organized Criticality. New York: Springer-Verlag
  10. Belew RK, Mitchell M, eds. 1996. Adap- tive Individuals in Evolving Populations: Models and Algorithms. Reading, MA: Ad- dison Wesley
  11. Belew RK, Vose MD, eds. 1997. Founda- tions of Genetic Algorithms 4. San Fran- cisco, CA: M. Kaufmann
  12. Chomsky N. 1995. The Minimalist Pro- gram. Cambridge, MA: MIT Press
  13. Christiansen FB, Feldman MW. 1998. Al- gorithms, genetics, and populations: the schemata theorem revisited. Complexity 3(3):57-64
  14. Chu J. 1999. Computational explorations of life. PhD thesis. Calif. Inst. Technol., Pasadena, CA
  15. Cliff D, Grand S. 1999. The 'Creatures' global digital ecosystem. Artificial Life. In press
  16. Coyne JA, Barton N, Turelli M. 1997. Per- spective: a critique of Sewall Wright's shifting balance theory of evolution. Evo- lution 51:643-71
  17. Dawkins R. 1989. The evolution of evolv- ability. In Artificial Life, ed. CG Langton, 201-220. Reading, MA: Addison-Wesley
  18. Dawkins R. 1996. The Blind Watchmaker: Why the Evidence of Evolution Reveals a Universe Without Design. New York: Nor- ton. 2nd ed.
  19. Depew DJ, Weber BH. 1995. Darwinism Evolving. Cambridge, MA: MIT Press
  20. Epstein J, Axtell R. 1996. Growing Artifi- cial Societies. Cambridge, MA: MIT Press
  21. Fogel DB. 1995. Evolutionary Compu- tation: Toward a New Philosophy of Machine Intelligence. New York: IEEE Press
  22. Fogel DB, ed. 1998. Evolutionary Com- putation: The Fossil Record. New York: IEEE Press
  23. Fogel LJ, Owens AJ, Walsh MJ. 1966. Arti- ficial Intelligence Through Simulated Evo- lution. New York: John Wiley
  24. Gehlhaar D, Verkhivker G, Rejto P, Sher- man C, Fogel D, et al. 1995. Molecular recognition of the inhibitor AG-1343 by HIV-1 protease: conformationally flexi- ble docking by evolutionary programming. Chem. Biol. 2:317-24
  25. Gold EM. 1967. Language identification in the limit. Inform. Control 10:447-74
  26. Goldberg DE. 1989. Genetic Algorithms in Search, Optimization, and Machine Learn- ing. Reading, MA: Addison-Wesley
  27. Gordon VS, Whitley D. 1993. Serial and parallel genetic algorithms as function op- timizers. In Proc. Fifth Int. Conf. Genetic Algorithms, ed. T Bäck, pp. 177-183. San Mateo, CA: M. Kaufmann
  28. Grefenstette JJ. 1991. Lamarckian learning in multi-agent environments. In Proc. 4th Int. Conf. on Genetic Algorithms and Their Applications, ed. RK Belew, L Booker, pp. 303-10. San Mateo, CA: M. Kaufmann
  29. Hillis WD. 1990. Co-evolving parasites improve simulated evolution as an opti- mization procedure. Physica D 42:228- 34
  30. Hinton GE, Nowlan SJ. 1987. How learn- ing can guide evolution. Complex Systems 1:495-502
  31. Holland JH. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michi. Press
  32. Hopfield J. 1982. Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. USA 79:2554-58
  33. Huynen MA, Stadler F, Fontana W. 1996. Smoothness within a rugged landscape: The role of neutrality in evolution. Proc. Natl. Acad. Sci. USA 93:397-401
  34. Imada A, Araki K. 1996. Lamarckian evo- lution and associative memory. In Proc. 1996 IEEE Third Int. Conf. Evol. Compu- tation (ICES-96):676-80
  35. Juillé H, Pollack JB. 1998. Coevolutionary learning: a case study. In ICML '98-Proc.
  36. Int. Conf. Machine Learning. San Fran- cisco, CA: M. Kaufmann
  37. Kaneko K. 1994. Chaos as a source of com- plexity and diversity in evolution. Artificial Life 1:163-77
  38. Karakotsios K, Bremer M. 1993. SimLife: The Official Strategy Guide. Rocklin, CA: Prima
  39. Kelly K. 1994. Out of Control: The Rise of Neo. Biological Civilization. Reading, MA: Addison-Wesley
  40. Knuth DE. 1973. The Art of Computer Pro- gramming. Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley
  41. Koza JR. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press
  42. Koza JR, Rice JP, Roughgarden J. 1992. Evolution food foraging strategies for the Caribbean anolis lizard using genetic programming. Adaptive Behav. 1(2):47-74
  43. Lamarck JB. 1809. Philosophie Zoolo- gique, ou Exposition des Considérations Relatives a l'Histoire Naturelle de Ani- maux. Paris: Chez Dentu et L'Auteur
  44. Lamarck JB. 1996. Of the influence of the environment on the activities and habits of animals, and the influence of the activities and habits of these living bodies in modi- fying their organization and structure. See Ref. 10, pp. 39-57
  45. Lewontin R. 1998. Survival of the nicest. NY Rev. Books. 22 Oct. 1998, 59-63
  46. Lindgren K. 1992. Evolutionary phenom- ena in simple dynamics. In Artificial Life II, ed. CG Langton, C Taylor, JD Farmer, S Rasmussen, pp. 295-312. Reading, MA: Addison-Wesley
  47. Maynard Smith J. 1987. Natural selection: when learning guides evolution. Nature 329:761-62
  48. Maynard Smith J. 1992. Byte-sized evolu- tion. Nature 355:772-73
  49. Miglino O, Nafasi K, Taylor CE. 1994. Se- lection for wandering behavior in a small robot. Artificial Life 2:101-16
  50. Mitchell M. 1996. An Introduction to Ge- netic Algorithms. Cambridge, MA: MIT Press
  51. Murakawa M, Yoshizawa S, Adachi T, Suzuki S, Takasuka K, et al. 1998. Ana- logue EHW chip for intermediate fre- quency filters. In Evolvable Systems: From Biology to Hardware, ed. M Sipper, D Mange, pp. 134-43. New York: Springer
  52. Niyogi P, Berwick RC. 1995. The Logical Problem of Language Change. Tech. Rep.
  53. A. I. Memo No. 1516. MIT Artificial Intel- ligence Lab. Cambridge, MA
  54. Papadimtriou CH, Sideri M. 1998. On the evolution of easy instances. Unpublished manuscript, Computer Science Dept., Uni- versity of California, Berkeley, CA
  55. Paredis J. 1997. Coevolving cellular au- tomata: Be aware of the red queen! In Proc. Seventh Int. Conf. Genetic Algo- rithms, ed. T Bäck, pp. 393-400. San Fran- cisco, CA: Morgan Kaufmann
  56. Petzinger Jr. T. 1995. At Deere they know a mad scientist may be the firm's biggest asset. Wall Street J. 14 July 1995, p. A1
  57. Press WH, A. Teukolsky S, Vetterling WT, Flannery BP. 1992. Numerical Recipes in C. New York: Cambridge Univ. Press
  58. Provine WB. 1986. Sewall Wright and Evo- lutionary Biology. Chicago, IL: Univ. Chi- cago Press
  59. Rao SS. 1998. Evolution at warp speed. Forbes Mag.
  60. Rawlins G, ed. 1991. Foundations of Ge- netic Algorithms. San Mateo, CA: M. Kaufmann
  61. Ray TS. 1991. An approach to the synthesis of life. In Artifical Life II, ed. CG Langton, C Taylor, J Farmer, S Rasmussen, pp. 371- 408. Reading, MA: Addison-Wesley
  62. Ray TS, Hart J. 1998. Evolution of differ- entiated multi-threaded digital organisms. In Artificial Life VI, ed. C Adami, RK Belew, H Kitano, CE Taylor, pp. 295-306. Cambridge, MA: MIT Press
  63. Rechenberg I. 1973. Evolutionsstrategie. Stuttgart: Frommann-Holzboog ?
  64. Rosin CD, Belew RK. 1995. Methods for competitive coevolution: finding oppo- nents worth beating. In Proc. Sixth Int. Conf. Genetic Algorithms, ed. LJ Eshel- man, pp. San Francisco, CA: M. Kauf- mann
  65. Sasaki T, Tokoro M. 1997. Adaptation to- ward changing environments: Why Dar- winian in nature? In Proc. Fourth Eur. Conf. on Artificial Life, Cam- bridge, MA: MIT Press
  66. Sasaki T, Tokoro M. 1999. Evolvable learn- able neural networks under changing en- vironments with various rates of inheri- tance of acquired characters: comparison between Darwinian and Lamarckian evo- lution. Artificial Life. In press
  67. Schwefel HP. 1975. Evolutionsstrategie und Numerische Optimierung. PhD thesis, Technische Univ. Berlin, Berlin
  68. Schwefel HP. 1995. Evolution and Opti- mum Seeking. New York: Wiley
  69. Sepkowski JJ. 1992. A Compendium of Fossil Marine Animal Families. Milwau- kee, WI: Milwaukee Public Mus. 2nd ed.
  70. Simon H. 1969. The Sciences of the Artifi- cial. Cambridge, MA: MIT Press
  71. Sims K. 1994. Evolving 3D morphology and behavior by competition. In Artificial Life IV, ed. RA Brooks, P Maes, pp. 28-39. Cambridge, MA: MIT Press
  72. Steels L, Kaplan F. 1998. Stochasticity as a source of innovation in language games. In Artificial Life VI, ed. C Adami, RK Belew, H Kitano, CE Taylor, pp. 368-78. Cam- bridge, MA: MIT Press
  73. Tanese R. 1989. Distributed genetic algo- rithms. In Proc. Third Int. Conf. on Genetic Algorithms, ed. JD Schaffer, pp. 434-39.
  74. van Nimwegen E, Crutchfield JP, Mitchell M. 1999. Statistical dynamics of the Royal Road genetic algorithm. Theoret. Com- puter Sci. To appear 73.
  75. van Nimwegen E, Crutchfield JP, Mitchell M. 1997. Finite populations induce metastability in evolutionary search. Phys. Lett. A, 229(2):144-50
  76. Waddington CH. 1953. Genetic assimila- tion of an acquired character. Evolution 7:118-26
  77. Werner GM, Dyer MG. 1991. Evolution of communication in artificial organisms. In Artificial Life II, ed. CG Langton, C Tay- lor, J Farmer, S Rasmussen, pp. 659-87. Reading, MA: Addison Wesley
  78. Whitley LD, ed. 1993. Foundations of Ge- netic Algorithms 2. San Mateo, CA: M. Kaufmann
  79. Whitley LD, Vose MD, eds. 1995. Foun- dations of Genetic Algorithms 3. San Fran- cisco, CA: M. Kaufmann

Related papers

Evolutionary computation
Kenneth De Jong

This article provides a brief overview of the field of Evolutionary Computation. It describes the important historical developments that shaped the field. It summarizes the field as it exists today and discusses some of the important directions in which the field is developing. Copyright © 2009 John Wiley & Sons, Inc.For further resources related to this article, please visit the WIREs website.

View PDFchevron_right
Evolutionary computing
Marc Schoenauer

Information Processing Letters, 2002

Evolutionary computing (EC) is an exciting development in Computer Science. It amounts to building, applying and studying algorithms based on the Darwinian principles of natural selection. In this paper we briefly introduce the main concepts behind evolutionary computing. We present the main components all evolutionary algorithms (EA), sketch the differences between different types of EAs and survey application areas ranging from optimization, modeling and simulation to entertainment.

View PDFchevron_right
Amplification of perspectives in the use of evolutionary computation
Jorge Barreto

Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering, 2000

Initially, different areas of research in computer science based on models inspired by Nature will be approached.

View PDFchevron_right
An overview of evolutionary computation
William Spears, Kenneth De Jong

Machine Learning: ECML …, 1993

View PDFchevron_right
Evolutionary Computation: Challenges and Duties
Carlos Cotta

Frontiers of Evolutionary Computation, 2004

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved