Scribd
Upload
82 views

Evolutionary Computing: Presented By: Praveen Yadav (CSE-IV Yr.) Smrittee Priya (CSE-IV Yr.)

Evolutionary computing is a subfield of artificial intelligence that uses principles of biological evolution, such as natural selection and inheritance, to solve problems. It involves using populations of candidate solutions that undergo processes of selection, recombination, and mutation to evolve toward better solutions. Common techniques include genetic algorithms, genetic programming, evolution strategies, and evolutionary programming, which generate solutions to optimization and search problems by evolving initial populations through generations.

Uploaded by

sandy_jaat
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
82 views

Evolutionary Computing: Presented By: Praveen Yadav (CSE-IV Yr.) Smrittee Priya (CSE-IV Yr.)

Evolutionary computing is a subfield of artificial intelligence that uses principles of biological evolution, such as natural selection and inheritance, to solve problems. It involves using populations of candidate solutions that undergo processes of selection, recombination, and mutation to evolve toward better solutions. Common techniques include genetic algorithms, genetic programming, evolution strategies, and evolutionary programming, which generate solutions to optimization and search problems by evolving initial populations through generations.

Uploaded by

sandy_jaat
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

EVOLUTIONARY

COMPUTING

Presented By:
Praveen Yadav(CSE-IV yr.)
Smrittee Priya(CSE-IV yr.)
Introduction:
 based to some degree on the evolution of
biological life in the natural world.
 used to create behavior control programs for
artificial agents.
 the most widely used form of evolutionary
computation are genetic algorithms
 uses the Genetic Programming technique
which allows the evolution of executable
programs.
Evolutionary computation:
 evolutionary computation is a subfield of artificial
intelligence that involves combinatorial
optimization problems.
 computation uses iterative progress, such as
growth or development in a population.
 this population is then selected in a guided
random search using parallel processing to
achieve the desired end
 often inspired by biological mechanisms of
evolution.
History:
 Introduced by Lawrence J. Fogel in the USA, while
John Henry Holland called his method a genetic
algorithm.
 In Germany Ingo Rechenberg andHans Paul
Schwefel introduced evolution strategies.
 From the early nineties,the technology
evolutionary computing emerged.
 evolutionary programming, evolution strategies,
genetic algorithms, and genetic programming are
its sub-areas.
Techniques:
 Evolutionary techniques mostly involve
metaheuristic optimization algorithms .
 Evolutionary algorithms and swarm intelligence
based
 self-organization
 differential evolution
 artificial life
 cultural algorithms
 harmony search algorithm
Evolutionary algorithm:
 Evolutionary algorithms form a subset of
evolutionary computation
 involve techniques implementing
mechanisms inspired by biological evolution.
 involves candidate solution and cost function.
 evolution of the population takes place after
the repeated application of the above
operators.
Evolutionary system forces:
 there are two main forces that form the basis
of evolutionary systems
 recombination and mutation create the
necessary diversity and thereby facilitate
novelty.
 selection acts as a force increasing quality.
 changed pieces of information due to
recombination and mutation are randomly
chosen.
Evolutionary algorithm
techniques:
 Genetic algorithm
 Genetic programming
 Evolution strategies
 Evolutionary programming
 Differential evolution
 Particle swarm optimisation
Evolutionary programming:
 first used by Lawrence J. Fogel in the US in 1960
 Fogel used finite state machines as predictors
and evolved them
 currently evolutionary programming is a wide
evolutionary computing dialect with no fixed
structure
 its main variation operator is mutation
 each parent generates an offspring, using a (μ +
μ) survivor selection.
Advantages:
 scale well to higher dimensional problems.
 robust with respect to noisy evaluation
functions
 can easily be adjusted to the problem at
hand.
 any aspect of the algorithm may be changed
and customized.
Conclusion:
 its very reliable if used appropriately
 although lots of research has been done on
which evolutionary algorithm is best suited
for a given problem, still more is awaited.
 premature convergence to a local extremum
may result from adverse configuration and
not yield the global extremum.
Bibliography:
1. www.wikipedia.org
2. www.google.co.in
3. www.hba.com
4. Evolutionary computation and
applications:Fogel

You might also like