Content deleted Content added
m Open access bot: doi added to citation with #oabot. |
Citation bot (talk | contribs) Add: doi-access, article-number, bibcode. Removed URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Jay8g | #UCB_toolbar |
||
(39 intermediate revisions by 21 users not shown) | |||
Line 1:
{{
This is a list of '''[[genetic algorithm]] (GA) applications'''.
==Natural Sciences, Mathematics and Computer Science==
* Bayesian inference links to particle methods in Bayesian statistics and hidden Markov chain models<ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-statistics.html|title=Del Moral - Bayesian Statistics|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://web.archive.org/web/20120501080015/http://www.math.u-bordeaux1.fr/~delmoral/simu-statistics.html
* [[Computational creativity|Artificial creativity]]
* Chemical kinetics ([https://archive.
* Calculation of [[bound state]]s and [[local-density approximation]]s
* [[Code-breaking]], using the GA to search large solution spaces of [[cipher]]s for the one correct decryption.<ref>Joachim De Zutter</ref>
Line 14:
* [[Distributed computer network]] [[topologies]]
* Electronic circuit design, known as [[evolvable hardware]]
* [[Evolutionary image processing]]
* [[Feature selection]] for [[Machine learning|Machine Learning]]<ref>{{Cite web|url=https://www.kdnuggets.com/2017/11/rapidminer-evolutionary-algorithms-feature-selection.html|title=Evolutionary Algorithms for Feature Selection|website=www.kdnuggets.com|language=en-US|access-date=2018-02-19}}</ref>
* Feynman-Kac models <ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simulinks.html|title=Website for Feynman-Kac particle models|work=u-bordeaux1.fr|url-status=dead|
* File allocation for a [[distributed system]]
* Filtering and signal processing <ref>{{Cite web |url=http://www.math.u-bordeaux1.fr/~delmoral/simu-filtering.html
* Finding hardware bugs.<ref>Hitoshi Iba, Sumitaka Akiba, Tetsuya Higuchi, Taisuke Sato: BUGS: A Bug-Based Search Strategy using Genetic Algorithms. PPSN 1992:</ref><ref>Ibrahim, W. and Amer, H.: An Adaptive Genetic Algorithm for VLSI Test Vector Selection</ref>
* [[Game theory]] equilibrium resolution
* [[Genetic Algorithm for Rule Set Production]]
* [[Genetic algorithm scheduling|Scheduling applications]], including [[Job Shop Scheduling|job-shop scheduling]] and scheduling in [[printed circuit board]] assembly.<ref name="PCB">{{cite journal | last1 = Maimon | first1 = Oded | last2 = Braha | first2 = Dan | year = 1998 | title = A genetic algorithm approach to scheduling PCBs on a single machine | url = http://necsi.edu/affiliates/braha/IJPR_GA.pdf | journal = International Journal of Production Research | volume = 36 | issue = 3| page = 3 | doi = 10.1080/002075498193688 | citeseerx = 10.1.1.129.9504 }}</ref> The objective being to schedule jobs in a [[sequence-dependent setup|sequence-dependent]] or non-sequence-dependent setup environment in order to maximize the volume of production while minimizing penalties such as tardiness. Satellite communication scheduling for the NASA Deep Space Network was shown to benefit from genetic algorithms.<ref>{{Cite book |doi = 10.1109/AERO.2007.352900|chapter = Deep Space Network Scheduling Using Evolutionary Computational Methods|title = 2007 IEEE Aerospace Conference|pages = 1–6|year = 2007|last1 = Guillaume|first1 = Alexandre|last2 = Lee|first2 = Seugnwon|last3 = Wang|first3 = Yeou-Fang|last4 = Zheng|first4 = Hua|last5 = Hovden|first5 = Robert|last6 = Chau|first6 = Savio|last7 = Tung|first7 = Yu-Wen|last8 = Terrile|first8 = Richard J.|isbn = 978-1-4244-0524-4|s2cid = 15862933}}</ref>
*
* Image processing: Dense pixel matching<ref>A. dos Santos-Paulino, J.-C. Nebel and F.Florez-Revuelta (2014) Evolutionary algorithm for dense pixel matching in presence of distortions, EvoStar Conference, Granada, Spain, 23–25 April 2014</ref>
* Learning fuzzy rule base using genetic algorithms
* Molecular structure optimization (chemistry)
* Optimisation of data compression systems, for example using [[wavelet]]s.
* [[Power electronics]] design.<ref>{{Cite journal |url=http://www.cs.sysu.edu.cn/~jzhang/papers/SMCC.pdf
* [[Traveling salesman problem]] and its applications<ref name="PCB"/>
* Stopping propagations, i.e. deciding how to cut edges in a graph so that some infectious condition (e.g. a disease, fire, computer virus, etc.) stops its spread. A bi-level genetic algorithm (i.e. a genetic algorithm where the fitness of each individual is calculated by running another genetic algorithm) was used due to the Σ<sup>P</sup><sub>2</sub>-completeness of the problem.<ref name="GRR">{{cite journal | last1 = Galiana| first1 = J.| last2 = Rodríguez| first2 = I. | last3 = Rubio| first3 = F. | year = 2023| title = How to stop undesired propagations by using bi-level genetic algorithms. | journal = Applied Soft Computing | volume = 136 | issue = 110094| article-number = 110094| doi = 10.1016/j.asoc.2023.110094| doi-access = free}}</ref>
==Earth Sciences==
* [[Climatology]]: Estimation of [[heat flux]] between the atmosphere and sea ice<ref>{{cite
* [[Climatology]]: Modelling [[Temperature record|global temperature]] changes<ref>{{cite journal | title=Modelling global temperature changes with genetic programming. | journal=Computers and Mathematics with Applications |author1=Karolina Stanislawska |author2=Krzysztof Krawiec |author3=Zbigniew W. Kundzewicz | date=April 2012 |
* Design of [[water resource]] systems <ref name = "Zhang & Babovic 2012">{{cite journal |
* Groundwater monitoring networks<ref>[https://purl.fdlp.gov/GPO/gpo41529 Optimization of Water-level Monitoring Networks in the Eastern Snake River Plain Aquifer Using a Kriging-based Genetic Algorithm Method] [[United States Geological Survey]]</ref>
==Finance and Economics==
* [[Financial mathematics]]<ref name="hal.inria.fr"/><ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-finance.html|title=Del Moral - Financial Mathematics|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://archive.
** [[Real options valuation]]
** [[Portfolio optimization]]<ref>Sefiane, Slimane and Benbouziane, Mohamed (2012). [http://www-math.unice.fr/publis/delmoral_lezaud.ps ''Portfolio Selection Using Genetic Algorithm''] {{Webarchive|url=https://web.archive.org/web/20160429142443/http://www-math.unice.fr/publis/delmoral_lezaud.ps |date=2016-04-29 }}, Journal of Applied Finance & Banking
▲** [[Real options valuation]] <ref name = "Zhang & Babovic">{{cite journal |last=Zhang |first=S.X. |last2=Babovic |first2=V. |year=2011 |title=An evolutionary real options framework for the design and management of projects and systems with complex real options and exercising conditions |journal=Decision Support Systems |volume=51 |issue=1 |pages=119–129 |doi= 10.1016/j.dss.2010.12.001|ssrn= |url=https://www.researchgate.net/publication/220197192}}</ref>
▲** [[Portfolio optimization]]<ref>Sefiane, Slimane and Benbouziane, Mohamed (2012). [http://www-math.unice.fr/publis/delmoral_lezaud.ps ''Portfolio Selection Using Genetic Algorithm''] {{Webarchive|url=https://web.archive.org/web/20160429142443/http://www-math.unice.fr/publis/delmoral_lezaud.ps |date=2016-04-29 }}, Journal of Applied Finance & Banking , Vol. 2, No. 4 (2012): pp. 143-154.</ref>
* [[Genetic algorithm in economics]]
** Representing rational agents in economic models such as the [[cobweb model]]
** the same, in [[Agent-based computational economics]] generally, and in [[artificial financial market]]s
==Social Sciences==
*Design of [[anti-terrorism]] systems <ref name = "Buurman, Zhang & Babovic">{{cite journal |
* Linguistic analysis, including [[grammar induction]] and other aspects of [[Natural language processing]] (NLP) such as [[word
* Finding the optimum subset of questions from a candidate pool of questions in psychological test design <ref name="VanDerLinde2018">{{cite journal |last1=van der Linde |first1=I. |last2=Bright |first2=P. |title=A genetic algorithm to find optimal reading test word subsets for estimating full-scale IQ |journal=PLOS ONE |year=2018 |volume=13 |issue=10 |pages=e0205754 |doi=10.1371/journal.pone.0205754 |bibcode=2018PLoSO..1305754V |doi-access=free }}
</ref>
==Industry, Management and Engineering==
Line 53 ⟶ 56:
* Airlines revenue management<ref>Aloysius George, B. R. Rajakumar, D. Binu, (2012) [http://dl.acm.org/citation.cfm?id=2345426 "Genetic algorithm based airlines booking terminal open/close decision system"]</ref>
* Automated design of [[mechatronics|mechatronic]] systems using [[bond graphs]] and [[genetic programming]] (NSF)
* Automated design of industrial equipment using catalogs of exemplar lever patterns
* [[Automated]] design, including research on [[composite material]] design and [[multi-objective]] design of automotive components for [[crashworthiness]], weight savings, and other characteristics
* [[Automated planning]] of structural inspection<ref name="EllefsenLepikson2017">{{cite journal|last1=Ellefsen|first1=K.O.|last2=Lepikson|first2=H.A.|last3=Albiez|first3=J.C.|title=Multiobjective coverage path planning: Enabling automated inspection of complex, real-world structures|journal=Applied Soft Computing|volume=61|year=2017|pages=264–282|issn=1568-4946|doi=10.1016/j.asoc.2017.07.051|url=https://www.researchgate.net/publication/318893583|arxiv=1901.07272|hdl=10852/58883|s2cid=6183350}}</ref>
* Container loading optimization
* [[Control engineering]],<ref>{{cite
* [[Marketing mix]] analysis
* [[Mechanical engineering]]<ref name="iit kanpur" >{{cite web
Line 69 ⟶ 71:
* Mobile communications infrastructure [[Optimization (mathematics)|optimization]].
* [[Plant floor layout]]
* [[Pop music]] record production<ref>{{cite news| url=http://news.bbc.co.uk/2/hi/entertainment/123983.stm | work=BBC News | title=To the beat of the byte | date=1998-07-01 |
* [[Quality control and genetic algorithms|Quality control]]
*[[Sorting network]]
* Timetabling problems, such as designing a non-conflicting class timetable for a large university
* [[Vehicle routing problem]] <ref>{{Cite journal|vauthors=Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W|title=A hybrid genetic algorithm for multidepot and periodic vehicle routing problems|journal=Operations Research|volume=60|issue=3|pages=611–624|doi=10.1287/opre.1120.1048|year=2012|url=https://www.cirrelt.ca/documentstravail/cirrelt-2010-34.pdf }}</ref>
* Optimal bearing placement <ref>{{Cite journal|
* [[Computer-automated design]]
==Biological Sciences and Bioinformatics==
* [[Bioinformatics]] [[Multiple Sequence Alignment]]<ref name="Gondro">{{cite journal|vauthors=Gondro C, Kinghorn BP | title = A simple genetic algorithm for multiple sequence alignment | journal = Genetics and Molecular Research | year = 2007 | volume = 6 | pages = 964–982 |issue= 4|pmid= 18058716 }}</ref><ref name="Notredame">{{cite journal|vauthors=Notredame C, Higgins DG | title = SAGA a Genetic Algorithm for Multiple Sequence Alignment | journal = Nucleic Acids Research | year = 1995 | volume = 24 | pages = 1515–24 | pmid = 8628686|issue= 8|pmc= 145823 | doi=10.1093/nar/24.8.1515}}</ref><ref>{{cite web|url=http://www.tcoffee.org/homepage.html|title=Notredame Lab Home Page - Comparative Bioinformatics|work=tcoffee.org}}</ref>
* [[Bioinformatics]]: [[RNA]] structure prediction<ref name="Batenburg">{{cite journal|vauthors=van Batenburg FH, Gultyaev AP, Pleij CW | title = An APL-programmed genetic algorithm for the prediction of RNA secondary structure | journal = Journal of Theoretical Biology | year = 1995 | volume = 174 | pages = 269–280 | pmid = 7545258 | doi = 10.1006/jtbi.1995.0098|issue= 3 | bibcode = 1995JThBi.174..269V }}</ref>
* [[Bioinformatics]]: [[Motif Discovery]]<ref>{{cite journal|title=Generalizing and learning protein-DNA binding sequence representations by an evolutionary algorithm | doi=10.1007/s00500-011-0692-5 | volume=15|issue=8 |journal=Soft Computing|pages=1631–1642|year=2011 |last1=Wong |first1=Ka-Chun |last2=Peng |first2=Chengbin |last3=Wong |first3=Man-Hon |last4=Leung |first4=Kwong-Sak | s2cid=18253131 }}</ref>
* Biology and [[computational chemistry]]<ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-biology.html|title=Del Moral - Biology & Chemistry|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://web.archive.org/web/20120501080114/http://www.math.u-bordeaux1.fr/~delmoral/simu-biology.html
* Building [[phylogenetic tree]]s.<ref name="Hill">{{cite journal|vauthors=Hill T, Lundgren A, Fredriksson R, Schiöth HB | title = Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins | journal = Biochimica et Biophysica Acta (BBA) - General Subjects | year = 2005 | volume = 1725 | pages = 19–29 | pmid = 15990235|issue= 1|doi= 10.1016/j.bbagen.2005.04.027 }}</ref>
* [[Expression profiling|Gene expression profiling]] analysis.<ref name="To">{{cite journal|vauthors=To CC, Vohradsky J | title = A parallel genetic algorithm for single class pattern classification and its application for gene expression profiling in Streptomyces coelicolor | journal = BMC Genomics | year = 2007 | volume = 8 |
* [[Medicine]]: [[Clinical decision support]] in ophthalmology<ref>{{cite journal | title=Genetic Programming with Alternative Search Drivers for Detection of Retinal Blood Vessels |author1=Krzysztof Krawiec |author2=Mikołaj Pawlak | date=April 10, 2015 | url=https://www.researchgate.net/publication/272017132}}</ref> and oncology<ref>{{cite
* [[Computational Neuroscience]]: finding values for the maximal conductances of ion channels in biophysically detailed neuron models<ref>{{cite journal |last1=Van Geit |first1=Werner |last2=Gevaert |first2=Michael |last3=Chindemi |first3=Giuseppe |last4=Rössert |first4=Christian |last5=Courcol |first5=Jean-Denis |last6=Muller |first6=Eilif B. |last7=Schürmann |first7=Felix |last8=Segev |first8=Idan |last9=Markram |first9=Henry |title=BluePyOpt: Leveraging Open Source Software and Cloud Infrastructure to Optimise Model Parameters in Neuroscience |journal=Frontiers in Neuroinformatics |date=7 June 2016 |volume=10 |pages=17 |doi=10.3389/fninf.2016.00017|pmid=27375471 |pmc=4896051 |bibcode=2016arXiv160300500V |arxiv=1603.00500 |doi-access=free }}</ref>
* [[Protein folding]] and protein/[[ligand docking]]<ref name="Willet">{{cite journal|author= Willett P | title = Genetic algorithms in molecular recognition and design | journal = Trends in Biotechnology | year = 1995 | volume = 13 | pages = 516–521 | pmid = 8595137 | doi = 10.1016/S0167-7799(00)89015-0|issue= 12}}</ref><ref>{{cite
* Selection of optimal mathematical model to describe biological systems
* [[Operon]] prediction.<ref name="Wang">{{cite journal|vauthors=Wang S, Wang Y, Du W, Sun F, Wang X, Zhou C, Liang Y | title = A multi-approaches-guided genetic algorithm with application to operon prediction | journal = Artificial Intelligence in Medicine | year = 2007 | volume = 41 | pages = 151–159 | pmid = 17869072 | doi = 10.1016/j.artmed.2007.07.010|issue= 2}}</ref>
Line 93 ⟶ 95:
* [[Neural network|Neural Network]]s; particularly [[recurrent neural networks]]<ref>{{cite web|url=http://arimaa.com/arimaa/about/Thesis/|title=Applying Genetic Algorithms to Recurrent Neural Networks for Learning Network Parameters and Architecture|work=arimaa.com}}</ref>
* Training [[artificial neural networks]] when pre-classified training examples are not readily obtainable ([[neuroevolution]])
==Physics==
* Optimization of beam dynamics in [[accelerator physics]].<ref>
{{cite conference
| url = http://jacow.org/ipac2016/papers/wepoy039.pdf
| title = GIOTTO: A Genetic Code for Demanding Beam-dynamics Optimizations
| last1 = Bacci
| first1 = A.
| last2 = Petrillo
| first2 = V.
| last3 = Rossetti Conti
| first3 = M.
| date = 2016
| doi = 10.18429/JACoW-IPAC2016-WEPOY039
| publisher = Joint Accelerator Conferences Website (JACoW)
| book-title = International Particle Accelerator Conference (7th)
| id = WEPOY039
}}</ref>
* Design of [[particle accelerator]] beamlines <ref>{{cite journal
| last1 = Rossetti Conti
| first1 = M.
| last2 = Bacci
| first2 = A.
| date = 2018
| title = Electron beam transfer line design for plasma driven Free Electron Lasers
| url = https://www.sciencedirect.com/science/article/pii/S0168900218302158
| journal = Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
| volume = 909
| pages = 84–89
| issn = 0168-9002
| doi = 10.1016/j.nima.2018.02.061
| arxiv = 1803.00431
| bibcode = 2018NIMPA.909...84R
| s2cid = 56365602
}}</ref>
==Other Applications==
* Clustering, using genetic algorithms to optimize a wide range of different fit-functions.{{dead link|date=December 2014}}<ref>Auffarth, B. (2010). Clustering by a Genetic Algorithm with Biased Mutation Operator. WCCI CEC. IEEE, July 18–23, 2010. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.869{{Dead link|date=November 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref>
* [[Multidimensional systems]]
* [[Evolutionary multimodal optimization|Multimodal Optimization
* Multiple criteria production scheduling<ref name="Bagchi">{{cite book|author= Bagchi Tapan P | title = Multiobjective Scheduling by Genetic Algorithms | year = 1999 | publisher = [[Kluwer Academic]] | isbn = 978-0-7923-8561-5 }}</ref>
* Multiple population [[topologies]] and interchange [[methodologies]]
* [[Mutation testing]]
* [[Parallelization]] of GAs/GPs including use of [[hierarchical decomposition]] of [[problem domains]] and design spaces [[Nesting problem (geometric optimization)|nesting of irregular shapes]] using [[feature matching]] and GAs.
* Rare event analysis <ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-rare-events.html|title=Del Moral - Rare events|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://web.archive.org/web/20120423152151/http://www.math.u-bordeaux1.fr/~delmoral/simu-rare-events.html
* Solving the machine-component grouping problem required for [[cellular manufacturing]] systems
* Stochastic optimization <ref>{{cite web|url=http://www.math.u-bordeaux1.fr/~delmoral/simu-optim.html|title=Del Moral - Optimal Control|work=u-bordeaux1.fr|access-date=2011-12-29|archive-url=https://web.archive.org/web/20120508011256/http://www.math.u-bordeaux1.fr/~delmoral/simu-optim.html
* [[Tactical asset]] allocation and [[international equity]] strategies
* Wireless sensor/ad-hoc networks.<ref>[http://dssg.cs.umb.edu/wiki/index.php/BiSNET/e BiSNET/e – Distributed Software Systems Group, University of Massachusetts, Boston<!-- Bot generated title -->] {{webarchive|url=https://web.archive.org/web/20090622110049/http://dssg.cs.umb.edu/wiki/index.php/BiSNET/e |date=2009-06-22 }}</ref>
Line 114 ⟶ 151:
[[Category:Mathematics-related lists]]
[[Category:Genetic algorithms|Applications]]
[[Category:Applications of evolutionary algorithms]]
|