100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Detailed summary of Evolution Computing Lecture notes + additional information $11.23
Add to cart

Summary

Detailed summary of Evolution Computing Lecture notes + additional information

 8 views  0 purchase
  • Course
  • Institution

A detailed summary of Evolution Computing Lecture notes + additional information

Preview 4 out of 235  pages

  • October 27, 2024
  • 235
  • 2024/2025
  • Summary
avatar-seller
🧑🏼‍🏫
Summary Slides
Chapter 0 - Evolutionary Problem Solving
The EC metaphor
Chapter 1 - Problems to be Solved
Black Box Model
Optimisation
Modelling
Simulation
Search Problems
Problem versus Problem-Solvers
Optimisation versus Constraint Satisfaction
NP Problems
Key Notions
Classes
Difference between Classes
Chapter 2 - The Origins
Motivation for EC
Darwinian Evolution
Survival of the Fittest
Diversity drives Change
Summary
Adaptive Landscape Metaphor
Genes and the Genome
Genetics
Homo Sapiens
Reproductive Cells
Crossing-over during Meiosis
Mutation
Development after Fertilisation
Genetic Code
Transcription, Translation
Important Points
Chapter 3: What is an EA?
Common Model of Evolutionary Processes
Two Pillars of Evolution
What is an EA?



Summary Slides 1

, Main EA Components
Representation
Evaluation / Fitness Function
Population
Selection
Survivor Selection
Variation Operators
Mutation
Recombination
Initialisation/Termination
Different Types of EAs
Solving the 8-queens problem
Problem
Representation
Fitness Evaluation
Mutation
Recombination
Parent Selection
Survivor Selection (Replacement)
EA Specification Tablea
Typical EA behaviour
Stages
Working of an EA demo
Progression of Fitness
Are long runs beneficial?
Is it worth expending effort on smart Initialisation?
EA in Context
EA as Problem Solvers
Goldberg View, 1989
EAs and Domain Knowledge
Michalewicz View, 1996
EC and Global Optimisation
EC and Neighbourhood Search
General Scheme of EAs
Version 1 versus Version 2
Important Points
Chapter 4: Representation, Mutation, Recombination
Role of Representation and Variation Operators
Two Sides of Representation
Representation (dis)continuity
Strong Causality Principle, Continuity, Locality
Good Representations



Summary Slides 2

, Binary Representation
Bit-Flip Mutation
1-point crossover
Alternative Crossover
n-point Crossover
Uniform Crossover
Crossover OR Mutation?
Integer Representation
Crossover
Mutation
Real-Valued or Floating-Point Representation
Mapping Real Values on Bit Strings
Uniform Mutation
Non-Uniform Mutation
Self-Adaptive Mutation
Uncorrelated Mutation with one σ 
Uncorrelated Mutation with n σ ’s
Correlated Mutations
Recombination
Single Arithmetic Crossover At Random
Single Arithmetic Crossover Mix Values
Whole Arithmetic Crossover
Blend Crossover
Overview different possible offspring
Multi-Parent Recombination
Multi-Parent Recombination: Type 1
Multi-Parent Recombination: Type 2
Permutation Representation
TSP Example
Representation
Mutation
Swap Mutation
Insert Mutation
Scramble Mutation
Inversion Mutation
Crossover
Order 1 Crossover
Partially Mapped Crossover (PMX)
Cycle Crossover
Edge Recombination
Tree Representation




Summary Slides 3

, Mutation
Recombination
Important Points
Chapter 5: Fitness, Selection, and Population Management
Population Management
Two different population management models exist:
Generation Gap
Fitness Based Competition
Fitness-Proportionate Selection (FPS)
FPS and Function Transposition
Parent Selection: Scaling
Windowing
Sigma Scaling
Rank-Based Selection
Linear Ranking
Exponential Ranking
Sampling Algorithms
Tournament Selection
Parent Selection: Uniform
Survivor Selection
Fitness-Based Survivor Selection
Elitism
Delete Worst
Round-Robin Tournament
(μ, λ)-selection (“comma strategy”)
(μ + λ)-selection (“plus strategy”)
Selection Pressure
Multimodality
Genetic Drift
Approaches for Preserving Diversity
Explicit Approaches for Preserving Diversity
Fitness Sharing
Fitness Sharing Example
Crowding
Crowding versus Fitness Sharing
Implicit Approaches for Preserving Diversity
Automatic Speciation
Island Model Parallel EAs
Cellular EAs
Different Spaces
Important Points




Summary Slides 4

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller mchelleh. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $11.23. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

53068 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$11.23
  • (0)
Add to cart
Added