Editing Evolutionary algorithm (section)

==Applications==

The areas in which evolutionary algorithms are practically used are almost unlimited<ref name=":2" /> and range from industry,<ref>{{Cite book |last1=Sanchez |first1=Ernesto |url=http://link.springer.com/10.1007/978-3-642-27467-1 |title=Industrial Applications of Evolutionary Algorithms |last2=Squillero |first2=Giovanni |last3=Tonda |first3=Alberto |date=2012 |publisher=Springer Berlin Heidelberg |isbn=978-3-642-27466-4 |series=Intelligent Systems Reference Library |volume=34 |location=Berlin, Heidelberg |doi=10.1007/978-3-642-27467-1}}</ref><ref>{{Cite book |url=https://www.wiley.com/en-us/Evolutionary+Algorithms+in+Engineering+and+Computer+Science%3A+Recent+Advances+in+Genetic+Algorithms%2C+Evolution+Strategies%2C+Evolutionary+Programming%2C+Genetic+Programming+and+Industrial+Applications-p-9780471999027 |title=Evolutionary algorithms in engineering and computer science : recent advances in genetic algorithms, evolution strategies, evolutionary programming, genetic programming, and industrial applications |date=1999 |publisher=Wiley and Sons |isbn=0-585-29445-3 |editor-last=Miettinen |editor-first=Kaisa |location=Chichester |language=en |oclc=45728460 |editor-last2=Neittaanmäki |editor-first2=Pekka |editor-last3=Mäkelä |editor-first3=M. M. |editor-last4=Périaux |editor-first4=Jacques}}</ref> engineering,<ref name="VLSI" /><ref name=":0" /><ref>{{Cite book |last1=Gen |first1=Mitsuo |url=http://doi.wiley.com/10.1002/9780470172261 |title=Genetic Algorithms and Engineering Optimization |last2=Cheng |first2=Runwei |date=1999-12-17 |publisher=John Wiley & Sons, Inc. |isbn=978-0-470-17226-1 |series=Wiley Series in Engineering Design and Automation |location=Hoboken, NJ, USA |language=en |doi=10.1002/9780470172261}}</ref> complex scheduling,<ref name=":1" /><ref>{{Cite book |last1=Dahal |first1=Keshav P. |url=https://www.worldcat.org/oclc/184984689 |title=Evolutionary scheduling |last2=Tan |first2=Kay Chen |last3=Cowling |first3=Peter I. |date=2007 |publisher=Springer |isbn=978-3-540-48584-1 |location=Berlin |language=en |doi=10.1007/978-3-540-48584-1 |oclc=184984689}}</ref><ref>{{Cite journal |last1=Jakob |first1=Wilfried |last2=Strack |first2=Sylvia |last3=Quinte |first3=Alexander |last4=Bengel |first4=Günther |last5=Stucky |first5=Karl-Uwe |last6=Süß |first6=Wolfgang |date=2013-04-22 |title=Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria Memetic Computing |journal=Algorithms |language=en |volume=6 |issue=2 |pages=245–277 |doi=10.3390/a6020245 |issn=1999-4893|doi-access=free }}</ref> agriculture,<ref>{{Cite book |last=Mayer |first=David G. |url=http://link.springer.com/10.1007/978-1-4615-1717-7 |title=Evolutionary Algorithms and Agricultural Systems |date=2002 |publisher=Springer US |isbn=978-1-4613-5693-6 |location=Boston, MA |doi=10.1007/978-1-4615-1717-7}}</ref> robot movement planning<ref>{{Citation |last=Blume |first=Christian |title=Optimized Collision Free Robot Move Statement Generation by the Evolutionary Software GLEAM |date=2000 |url=http://link.springer.com/10.1007/3-540-45561-2_32 |work=Real-World Applications of Evolutionary Computing |volume= 1803|pages=330–341 |editor-last=Cagnoni |editor-first=Stefano |series=LNCS 1803 |place=Berlin, Heidelberg |publisher=Springer |language=en |doi=10.1007/3-540-45561-2_32 |isbn=978-3-540-67353-8 |access-date=2022-12-28|url-access=subscription }}</ref> and finance<ref>{{Citation |last1=Aranha |first1=Claus |title=Application of a Memetic Algorithm to the Portfolio Optimization Problem |date=2008 |url=http://link.springer.com/10.1007/978-3-540-89378-3_52 |work=AI 2008: Advances in Artificial Intelligence |volume=5360 |pages=512–521 |editor-last=Wobcke |editor-first=Wayne |place=Berlin, Heidelberg |publisher=Springer Berlin Heidelberg |doi=10.1007/978-3-540-89378-3_52 |isbn=978-3-540-89377-6 |access-date=2022-12-23 |last2=Iba |first2=Hitoshi |series=Lecture Notes in Computer Science |editor2-last=Zhang |editor2-first=Mengjie|url-access=subscription }}</ref><ref>{{Cite book |url=http://link.springer.com/10.1007/978-3-7908-1784-3 |title=Evolutionary Computation in Economics and Finance |date=2002 |publisher=Physica-Verlag HD |isbn=978-3-7908-2512-1 |editor-last=Chen |editor-first=Shu-Heng |series=Studies in Fuzziness and Soft Computing |volume=100 |location=Heidelberg |doi=10.1007/978-3-7908-1784-3}}</ref> to research<ref>{{Cite book |last1=Lohn |first1=J.D. |last2=Linden |first2=D.S. |last3=Hornby |first3=G.S. |last4=Kraus |first4=W.F. |title=IEEE Antennas and Propagation Society Symposium, 2004 |chapter=Evolutionary design of an X-band antenna for NASA's Space Technology 5 mission |date=June 2004 |chapter-url=https://ieeexplore.ieee.org/document/1331834 |volume=3 |pages=2313–2316 Vol.3 |doi=10.1109/APS.2004.1331834|hdl=2060/20030067398 |isbn=0-7803-8302-8 |hdl-access=free }}</ref><ref>{{Cite book |last1=Fogel |first1=Gary |url=https://linkinghub.elsevier.com/retrieve/pii/B9781558607972X50008 |title=Evolutionary Computation in Bioinformatics |last2=Corne |first2=David |date=2003 |publisher=Elsevier |isbn=978-1-55860-797-2 |language=en |doi=10.1016/b978-1-55860-797-2.x5000-8}}</ref> and [[Evolutionary art|art]]. The application of an evolutionary algorithm requires some rethinking from the inexperienced user, as the approach to a task using an EA is different from conventional exact methods and this is usually not part of the curriculum of engineers or other disciplines. For example, the fitness calculation must not only formulate the goal but also support the evolutionary search process towards it, e.g. by rewarding improvements that do not yet lead to a better evaluation of the original quality criteria. For example, if peak utilisation of resources such as personnel deployment or energy consumption is to be avoided in a scheduling task, it is not sufficient to assess the maximum utilisation. Rather, the number and duration of exceedances of a still acceptable level should also be recorded in order to reward reductions below the actual maximum peak value.<ref name=":3">{{Citation |last=Jakob |first=Wilfried |title=Applying Evolutionary Algorithms Successfully - A Guide Gained from Realworld Applications |date=2021 |url=https://publikationen.bibliothek.kit.edu/1000135763/121278298 |series=KIT Scientific Working Papers |volume=170 |place=Karlsruhe, FRG |publisher=KIT Scientific Publishing |doi=10.5445/IR/1000135763 |arxiv=2107.11300 |s2cid=236318422 |access-date=2022-12-23 }}</ref> There are therefore some publications that are aimed at the beginner and want to help avoiding beginner's mistakes as well as leading an application project to success.<ref name=":3" /><ref>{{Cite journal |last=Whitley |first=Darrell |date=2001 |title=An overview of evolutionary algorithms: practical issues and common pitfalls |url=https://linkinghub.elsevier.com/retrieve/pii/S0950584901001884 |journal=Information and Software Technology |language=en |volume=43 |issue=14 |pages=817–831 |doi=10.1016/S0950-5849(01)00188-4|s2cid=18637958 |url-access=subscription }}</ref><ref>{{Cite book |last1=Eiben |first1=A.E. |url=http://link.springer.com/10.1007/978-3-662-44874-8 |title=Introduction to Evolutionary Computing |last2=Smith |first2=J.E. |date=2015 |publisher=Springer Berlin Heidelberg |isbn=978-3-662-44873-1 |edition=2nd |series=Natural Computing Series |location=Berlin, Heidelberg |pages=147–163 |language=en |chapter=Working with Evolutionary Algorithms |doi=10.1007/978-3-662-44874-8|s2cid=20912932 }}</ref> This includes clarifying the fundamental question of when an EA should be used to solve a problem and when it is better not to.