Editing Evolution strategy (section)

{{Short description|Algorithm in computer science}}
{{Evolutionary algorithms}}
{{For|a specific strategy or a set of strategies in game theory|Evolutionary strategy}}
'''Evolution strategy (ES)''' from computer science is a subclass of [[evolutionary algorithms]], which serves as an [[optimization (mathematics)|optimization]] technique.<ref name=overview>{{cite journal |last1=Slowik |first1=Adam |last2=Kwasnicka |first2=Halina |title=Evolutionary algorithms and their applications to engineering problems |journal=Neural Computing and Applications |date=1 August 2020 |volume=32 |issue=16 |pages=12363–12379 |doi=10.1007/s00521-020-04832-8 |language=en |issn=1433-3058|doi-access=free }}</ref> It uses the major [[genetic operators]] [[mutation (evolutionary algorithm)|mutation]], [[recombination (evolutionary algorithm)|recombination]] and [[selection (evolutionary algorithm)|selection of parents]].<ref name=def>{{cite journal |last1=Alrashdi |first1=Zaid |last2=Sayyafzadeh |first2=Mohammad |title=(μ+λ) Evolution strategy algorithm in well placement, trajectory, control and joint optimisation |journal=Journal of Petroleum Science and Engineering |date=1 June 2019 |volume=177 |pages=1042–1058 |doi=10.1016/j.petrol.2019.02.047 |bibcode=2019JPSE..177.1042A |url=https://www.sciencedirect.com/science/article/pii/S0920410519301846 |issn=0920-4105|url-access=subscription }}</ref>