Summary
Summary Algorithm overview - 1BM120
- Course
- Institution
This document includes the algorithms and their pro and cons
[Show more]
Seller
Follow
AnneBannink
Reviews received
Content preview
Genetic algorithms:+ Widely used in every discipline.
+ Effective in complex problems on large search spaces.
+ Works for both discrete and real-valued candidate solutions
+ Easy to understand and extend
+ Supports multi-objective optimization
+ Effective with noisy/non-differentiable problems or non-analytic problems
+ Well suited to MOO since they are robust w.r.t. complexity of the problem and retain a set of
solutions each of which satisfies the objective
- Premature convergence
- Loss of diversity
- assumes genotypes and genetic operators
- Can require high computational time
- Simple GA has binary representation
Differential evolution:
+ Effective and popular
+ Repositories of bad fitting individuals can be used to improve diversity and performance
+ Changing population size can be used to balance exploration and exploitation.
+ Adaptive parameters can help to alter its behavior according to the characteristics of the fitness
landscape.
+ Can be used for nonlinear and nondifferentiable continuous space functions
Covariance matrix adaptation evolution strategies:
+ Exploits possible correlations between the variables
+ Tries to follow a path increasing the likelihood of taking successful steps
+ Self-tuning algorithm (no hyper-parameters)
+ Scale, rotation or translation is invariant
+ Restarts and adaptive population size can strongly improve the performances
Swarm intelligence:
+ Based on information exchange about promising solutions.
, + Well suitable for real-valued problems (discrete versions exist)
+ Simple and efficient
+ Does not require differentiable problem
Particle swarm optimization:
+ Simple
- Real-valued vectors
Ant colony optimization:
+ Can be extended with elitism
+ Excellent for constrained discrete problems
+ Adapts to new distances
+ Retains memory of entire colony
+ Less affected by poor initial solutions
+ Suited for combinatorial and constructive problems
- Less intuitive
Multi-objective particle swarm optimization:
+ Convergence and diversity
+ Can be extended with mutation operators and ε -dominance to OMOPSO to reduce crowding
- Lot of parameters to be tuned
OMOPSO:
+ Better distribution of solutions on the pareto front
- Additional hyper-parameter tuning
NSGA-II:
+ Introduces elitism
+ Uses fast dominated sorting to rank solutions
+ Leverages crowding distances to maintain diversity in the population -> diversity
The benefits of buying summaries with Stuvia:
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
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
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 AnneBannink. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $3.21. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
50064 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now