z-logo
open-access-imgOpen Access
Simulated Evolution and Learning
Author(s) -
Kalyanmoy Deb,
Arnab Bhattacharya,
Nirupam Chakraborti,
Partha Chakroborty,
Swagatam Das,
Joydeep Dutta,
Santosh K. Gupta,
Ashu Jain,
Varun Aggarwal,
Jürgen Branke,
Sushil J. Louis,
Kay Chen Tan
Publication year - 1999
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-48873-1
Subject(s) - computer science , artificial intelligence
The idea of mimicking processes of organic evolution on computers and using such algorithms for solving adaptation and optimization tasks can be traced back to the Sixties. Genetic Algorithms (GA), Evolutionary Programming (EP), and Evolution Strategies (ES), the still vivid different strata of this idea, have not only survived until now, but have become an important tool within what has been called Computational Intelligence, Soft Computing, as well as Natural Computation. An outline of Evolutionary Algorithms (EA — the common denominator for GA, EP, and ES) will be sketched, their differences pinpointed, some theoretical results summarized, and some applications mentioned.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom