Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Mutation (evolutionary algorithm)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Mutation without consideration of restrictions === [[File:Standard deviation diagram (decimal comma).svg|thumb|Example of a normally distributed random variable. Note that the given proportions of the subranges add up to 99.8 % and not 100 % due to rounding.]] A real number <math>x</math> can be mutated using [[normal distribution]] <math>\mathcal{N}(0,\sigma)</math> by adding the generated random value to the old value of the gene, resulting in the mutated value <math>x'</math>:<blockquote><math>x' = x + \mathcal{N}(0, \sigma)</math></blockquote>In the case of genes with a restricted range of values, it is a good idea to choose the step size of the mutation <math>\sigma</math> so that it reasonably fits the range <math>[x_{\min}, x_{\max}]</math> of the gene to be changed, e.g.:<blockquote><math>\sigma = \frac{x_\text{max} - x_\text{min}}{6}</math></blockquote>The step size can also be adjusted to the smaller permissible change range depending on the current value. In any case, however, it is likely that the new value <math>x'</math> of the gene will be outside the permissible range of values. Such a case must be considered a lethal mutation, since the obvious repair by using the respective violated limit as the new value of the gene would lead to a drift. This is because the limit value would then be selected with the entire probability of the values beyond the limit of the value range. The evolution strategy works with real numbers and mutation based on normal distribution. The step sizes are part of the [[Chromosome (genetic algorithm)|chromosome]] and are subject to evolution together with the actual decision variables.<ref>{{Cite book |last=Schwefel |first=Hans-Paul |url=https://www.researchgate.net/publication/220690578 |title=Evolution and optimum seeking |date=1995 |publisher=Wiley |isbn=978-0-471-57148-3 |series=Sixth-generation computer technology series |location=New York |pages=105–151 |language=en |chapter=Evolution Strategies for Numerical Optimization}}</ref><ref>{{Citation |last1=Schwefel |first1=Hans-Paul |last2=Rudolph |first2=Günter |title=Contemporary Evolution Strategies |date=1995 |work=Conf. Proc. of the Third European Conference on Artificial Life (ECAL'95) |publisher=Springer |isbn=978-3-540-59496-3 |editor-last=Morán |editor-first=F. |location=Berlin, New York |pages=893–907 |url=https://www.researchgate.net/publication/221531222 |editor-last2=Moreno |editor-first2=A. |editor-last3=Merelo |editor-first3=J.J. |editor-last4=Chacón |editor-first4=P.}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)