List of genetic algorithm applications

Last updated

This is a list of genetic algorithm (GA) applications.

Contents

Natural Sciences, Mathematics and Computer Science

Earth Sciences

Finance and Economics

Social Sciences

Industry, Management and Engineering

Biological Sciences and Bioinformatics

General Applications

Physics

Other Applications

Related Research Articles

<span class="mw-page-title-main">Genetic algorithm</span> Competitive algorithm for searching a problem space

In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems via biologically inspired operators such as selection, crossover, and mutation. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, and causal inference.

<span class="mw-page-title-main">Evolutionary algorithm</span> Subset of evolutionary computation

An evolutionary algorithm (EA) in computational intelligence is a subset of evolutionary computation, a generic population-based metaheuristic optimization algorithm. An EA uses mechanisms inspired by biological evolution, such as reproduction, mutation, recombination and selection. Candidate solutions to the optimization problem play the role of individuals in a population, and the fitness function determines the quality of the solutions. Evolution of the population then takes place after the repeated application of the above operators.

<span class="mw-page-title-main">Evolutionary computation</span> Trial and error problem solvers with a metaheuristic or stochastic optimization character

Evolutionary computation from computer science is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character.

<span class="mw-page-title-main">Particle swarm optimization</span> Iterative simulation method

In computational science, particle swarm optimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle's position and velocity. Each particle's movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions.

NeuroEvolution of Augmenting Topologies (NEAT) is a genetic algorithm (GA) for the generation of evolving artificial neural networks developed by Kenneth Stanley and Risto Miikkulainen in 2002 while at The University of Texas at Austin. It alters both the weighting parameters and structures of networks, attempting to find a balance between the fitness of evolved solutions and their diversity. It is based on applying three key techniques: tracking genes with history markers to allow crossover among topologies, applying speciation to preserve innovations, and developing topologies incrementally from simple initial structures ("complexifying").

Neuroevolution, or neuro-evolution, is a form of artificial intelligence that uses evolutionary algorithms to generate artificial neural networks (ANN), parameters, and rules. It is most commonly applied in artificial life, general game playing and evolutionary robotics. The main benefit is that neuroevolution can be applied more widely than supervised learning algorithms, which require a syllabus of correct input-output pairs. In contrast, neuroevolution requires only a measure of a network's performance at a task. For example, the outcome of a game can be easily measured without providing labeled examples of desired strategies. Neuroevolution is commonly used as part of the reinforcement learning paradigm, and it can be contrasted with conventional deep learning techniques that use backpropagation with a fixed topology.

<span class="mw-page-title-main">Swarm intelligence</span> Collective behavior of decentralized, self-organized systems

Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. The expression was introduced by Gerardo Beni and Jing Wang in 1989, in the context of cellular robotic systems.

Metaheuristic in computer science and mathematical optimization is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored. Metaheuristics may make relatively few assumptions about the optimization problem being solved and so may be usable for a variety of problems. Their use is always of interest when exact or other (approximate) methods are not available or are not expedient, either because the calculation time is too long or because, for example, the solution provided is too imprecise.

<span class="mw-page-title-main">Memetic algorithm</span> Algorithm for searching a problem space

A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm (GA) or more general evolutionary algorithm (EA). It may provide a sufficiently good solution to an optimization problem. It uses a suitable heuristic or local search technique to improve the quality of solutions generated by the EA and to reduce the likelihood of premature convergence.

Extremal optimization (EO) is an optimization heuristic inspired by the Bak–Sneppen model of self-organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling salesman problem and spin glasses, although the technique has been demonstrated to function in optimization domains.

<span class="mw-page-title-main">Grammatical evolution</span>

Grammatical evolution (GE) is a genetic programming (GP) technique (or approach) from evolutionary computation pioneered by Conor Ryan, JJ Collins and Michael O'Neill in 1998 at the BDS Group in the University of Limerick.

Multi-objective optimization or Pareto optimization is an area of multiple-criteria decision making that is concerned with mathematical optimization problems involving more than one objective function to be optimized simultaneously. Multi-objective is a type of vector optimization that has been applied in many fields of science, including engineering, economics and logistics where optimal decisions need to be taken in the presence of trade-offs between two or more conflicting objectives. Minimizing cost while maximizing comfort while buying a car, and maximizing performance whilst minimizing fuel consumption and emission of pollutants of a vehicle are examples of multi-objective optimization problems involving two and three objectives, respectively. In practical problems, there can be more than three objectives.

Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in software engineering can be stated as optimization problems. Optimization techniques of operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational complexity or their assumptions on the problem structure. Researchers and practitioners use metaheuristic search techniques, which impose little assumptions on the problem structure, to find near-optimal or "good-enough" solutions.

<span class="mw-page-title-main">Generative design</span> Iterative design process

Generative design is an iterative design process that uses software to generate outputs that fulfill a set of constraints iteratively adjusted by a designer. Whether a human, test program, or artificial intelligence, the designer algorithmically or manually refines the feasible region of the program's inputs and outputs with each iteration to fulfill evolving design requirements. By employing computing power to evaluate more design permutations than a human alone is capable of, the process is capable of producing an optimal design that mimics nature's evolutionary approach to design through genetic variation and selection. The output can be images, sounds, architectural models, animation, and much more. It is, therefore, a fast method of exploring design possibilities that is used in various design fields such as art, architecture, communication design, and product design.

Design Automation usually refers to electronic design automation, or Design Automation which is a Product Configurator. Extending Computer-Aided Design (CAD), automated design and Computer-Automated Design (CAutoD) are more concerned with a broader range of applications, such as automotive engineering, civil engineering, composite material design, control engineering, dynamic system identification and optimization, financial systems, industrial equipment, mechatronic systems, steel construction, structural optimisation, and the invention of novel systems.

<span class="mw-page-title-main">Meta-optimization</span>

Meta-optimization from numerical optimization is the use of one optimization method to tune another optimization method. Meta-optimization is reported to have been used as early as in the late 1970s by Mercer and Sampson for finding optimal parameter settings of a genetic algorithm.

<span class="mw-page-title-main">Evolutionary multimodal optimization</span>

In applied mathematics, multimodal optimization deals with optimization tasks that involve finding all or most of the multiple solutions of a problem, as opposed to a single best solution. Evolutionary multimodal optimization is a branch of evolutionary computation, which is closely related to machine learning. Wong provides a short survey, wherein the chapter of Shir and the book of Preuss cover the topic in more detail.

Natural computing, also called natural computation, is a terminology introduced to encompass three classes of methods: 1) those that take inspiration from nature for the development of novel problem-solving techniques; 2) those that are based on the use of computers to synthesize natural phenomena; and 3) those that employ natural materials to compute. The main fields of research that compose these three branches are artificial neural networks, evolutionary algorithms, swarm intelligence, artificial immune systems, fractal geometry, artificial life, DNA computing, and quantum computing, among others.

This glossary of artificial intelligence is a list of definitions of terms and concepts relevant to the study of artificial intelligence (AI), its subdisciplines, and related fields. Related glossaries include Glossary of computer science, Glossary of robotics, and Glossary of machine vision.

References

  1. ↑ "Del Moral - Bayesian Statistics". u-bordeaux1.fr. Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  2. 1 2 a tutorial on genetic particle models
  3. ↑ Joachim De Zutter
  4. ↑ Craig Aaen Stockdale (June 1, 2008). "A (r)evolution in Crime-fighting". Forensic Magazine.
  5. ↑ SymbioticSphere – Distributed Software Systems Group, University of Massachusetts, Boston Archived 2009-03-29 at the Wayback Machine
  6. ↑ "Evolutionary Algorithms for Feature Selection". www.kdnuggets.com. Retrieved 2018-02-19.
  7. ↑ "Website for Feynman-Kac particle models". u-bordeaux1.fr. Archived from the original on 2012-05-01.
  8. ↑ "a review article on genetic particle models". Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  9. ↑ "Feynman-Kac Formulae". u-bordeaux1.fr. Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  10. ↑ "links to particle filters". Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  11. ↑ a tutorial on genetic particle models
  12. ↑ Hitoshi Iba, Sumitaka Akiba, Tetsuya Higuchi, Taisuke Sato: BUGS: A Bug-Based Search Strategy using Genetic Algorithms. PPSN 1992:
  13. ↑ Ibrahim, W. and Amer, H.: An Adaptive Genetic Algorithm for VLSI Test Vector Selection
  14. 1 2 Maimon, Oded; Braha, Dan (1998). "A genetic algorithm approach to scheduling PCBs on a single machine" (PDF). International Journal of Production Research. 36 (3): 3. CiteSeerX   10.1.1.129.9504 . doi:10.1080/002075498193688.
  15. ↑ Guillaume, Alexandre; Lee, Seugnwon; Wang, Yeou-Fang; Zheng, Hua; Hovden, Robert; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J. (2007). "Deep Space Network Scheduling Using Evolutionary Computational Methods". 2007 IEEE Aerospace Conference. pp. 1–6. doi:10.1109/AERO.2007.352900. ISBN   978-1-4244-0524-4. S2CID   15862933.
  16. ↑ 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
  17. ↑ Jun Zhang; Chung, H.S.H.; Lo, W.L. (2006). "Pseudocoevolutionary genetic algorithms for power electronic circuits optimization" (PDF). IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews. 36 (4): 590–598. doi:10.1109/TSMCC.2005.855497. Archived from the original (PDF) on 2011-07-07. Retrieved 2010-08-09.
  18. ↑ Galiana, J.; Rodríguez, I.; Rubio, F. (2023). "How to stop undesired propagations by using bi-level genetic algorithms". Applied Soft Computing. 136 (110094). doi: 10.1016/j.asoc.2023.110094 .
  19. ↑ Karolina Stanislawska; Krzysztof Krawiec; Timo Vihma (July 15, 2015). "Genetic Programming for Estimation of Heat Flux between the Atmosphere and Sea Ice in Polar Regions". Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. pp. 1279–1286. doi:10.1145/2739480.2754675. ISBN   9781450334723. S2CID   2879084.
  20. ↑ Karolina Stanislawska; Krzysztof Krawiec; Zbigniew W. Kundzewicz (April 2012). "Modelling global temperature changes with genetic programming". Computers and Mathematics with Applications. 64 (12): 3717–3728. doi: 10.1016/j.camwa.2012.02.049 .
  21. ↑ Zhang, S.X.; Babovic, V. (2012). "A real options approach to the design and architecture of water supply systems using innovative water technologies under uncertainty". Journal of Hydroinformatics. 14 (1): 13–29. doi: 10.2166/hydro.2011.078 .
  22. ↑ Optimization of Water-level Monitoring Networks in the Eastern Snake River Plain Aquifer Using a Kriging-based Genetic Algorithm Method United States Geological Survey
  23. ↑ "Del Moral - Financial Mathematics". u-bordeaux1.fr. Archived from the original on 2012-12-11. Retrieved 2011-12-29.
  24. ↑ Zhang, S.X.; Babovic, V. (2011). "An evolutionary real options framework for the design and management of projects and systems with complex real options and exercising conditions". Decision Support Systems. 51 (1): 119–129. doi:10.1016/j.dss.2010.12.001. S2CID   15362734.
  25. ↑ Sefiane, Slimane and Benbouziane, Mohamed (2012). Portfolio Selection Using Genetic Algorithm Archived 2016-04-29 at the Wayback Machine , Journal of Applied Finance & Banking, Vol. 2, No. 4 (2012): pp. 143-154.
  26. ↑ Buurman, J.; Zhang, S.X.; Babovic, V. (2009). "Reducing risk through real options in systems design: the case of architecting a maritime domain protection system". Risk Analysis. 29 (3): 366–379. doi:10.1111/j.1539-6924.2008.01160.x. PMID   19076327. S2CID   36370133.
  27. ↑ Aloysius George, B. R. Rajakumar, D. Binu, (2012) "Genetic algorithm based airlines booking terminal open/close decision system"
  28. ↑ Ellefsen, K.O.; Lepikson, H.A.; Albiez, J.C. (2017). "Multiobjective coverage path planning: Enabling automated inspection of complex, real-world structures". Applied Soft Computing. 61: 264–282. arXiv: 1901.07272 . doi:10.1016/j.asoc.2017.07.051. hdl:10852/58883. ISSN   1568-4946. S2CID   6183350.
  29. ↑ "CiteSeerX — Citation Query Switching Control Systems and Their Design Automation via Genetic Algorithms". Psu.edu.
  30. ↑ Li, Y.; et al. (1996). "Genetic algorithm automated approach to design of sliding mode control systems". Int J Control. 63 (4): 721–739. CiteSeerX   10.1.1.43.1654 . doi:10.1080/00207179608921865.
  31. ↑ Loughborough University Institutional Repository. handle.net (thesis). Loughborough University. 2010-01-18. hdl:2134/5806.
  32. ↑ Patrascu, M. (2015). "Genetically enhanced modal controller design for seismic vibration in nonlinear multi-damper configuration". Proceedings of the Institution of Mechanical Engineers, Part I. 229 (2): 158–168. doi:10.1177/0959651814550540. S2CID   26599174.
  33. ↑ "Genetic Algorithms for Engineering Optimization" (PDF).
  34. ↑ "Applications of evolutionary algorithms in mechanical engineering".
  35. ↑ "To the beat of the byte". BBC News. 1998-07-01. Retrieved 2010-05-03.
  36. ↑ Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012). "A hybrid genetic algorithm for multidepot and periodic vehicle routing problems" (PDF). Operations Research. 60 (3): 611–624. doi:10.1287/opre.1120.1048.
  37. ↑ Liu, Shibing; Yang, Bingen (2017). "Optimal placement of water-lubricated rubber bearings for vibration reduction of flexible multistage rotor systems". Journal of Sound and Vibration. 407: 332–349. Bibcode:2017JSV...407..332L. doi:10.1016/j.jsv.2017.07.004.
  38. ↑ Li, Y.; et al. (2004). "CAutoCSD – Evolutionary search and optimisation enabled computer automated control system design". International Journal of Automation and Computing. 1 (1): 76–88. doi:10.1007/s11633-004-0076-8. S2CID   55417415.
  39. ↑ Gondro C, Kinghorn BP (2007). "A simple genetic algorithm for multiple sequence alignment". Genetics and Molecular Research. 6 (4): 964–982. PMID   18058716.
  40. ↑ Notredame C, Higgins DG (1995). "SAGA a Genetic Algorithm for Multiple Sequence Alignment". Nucleic Acids Research. 24 (8): 1515–24. doi:10.1093/nar/24.8.1515. PMC   145823 . PMID   8628686.
  41. ↑ "Notredame Lab Home Page - Comparative Bioinformatics". tcoffee.org.
  42. ↑ van Batenburg FH, Gultyaev AP, Pleij CW (1995). "An APL-programmed genetic algorithm for the prediction of RNA secondary structure". Journal of Theoretical Biology. 174 (3): 269–280. Bibcode:1995JThBi.174..269V. doi:10.1006/jtbi.1995.0098. PMID   7545258.
  43. ↑ Wong, Ka-Chun; Peng, Chengbin; Wong, Man-Hon; Leung, Kwong-Sak (2011). "Generalizing and learning protein-DNA binding sequence representations by an evolutionary algorithm". Soft Computing. 15 (8): 1631–1642. doi:10.1007/s00500-011-0692-5. S2CID   18253131.
  44. ↑ "Del Moral - Biology & Chemistry". u-bordeaux1.fr. Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  45. ↑ "an article on genetic particle models". Archived from the original on 2012-05-01. Retrieved 2011-12-29.
  46. ↑ Hill T, Lundgren A, Fredriksson R, Schiöth HB (2005). "Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins". Biochimica et Biophysica Acta (BBA) - General Subjects. 1725 (1): 19–29. doi:10.1016/j.bbagen.2005.04.027. PMID   15990235.
  47. ↑ To CC, Vohradsky J (2007). "A parallel genetic algorithm for single class pattern classification and its application for gene expression profiling in Streptomyces coelicolor". BMC Genomics. 8: 49. doi: 10.1186/1471-2164-8-49 . PMC   1804277 . PMID   17298664.
  48. ↑ Krzysztof Krawiec; Mikołaj Pawlak (April 10, 2015). "Genetic Programming with Alternative Search Drivers for Detection of Retinal Blood Vessels".{{cite journal}}: Cite journal requires |journal= (help)
  49. ↑ Fitzgerald, Jeannie, Ryan, Conor, Medernach, David and Krawiec, Krzysztof (July 15, 2015). "An Integrated Approach to Stage 1 Breast Cancer Detection". Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. pp. 1199–1206. doi:10.1145/2739480.2754761. ISBN   9781450334723. S2CID   14110665.{{cite book}}: CS1 maint: multiple names: authors list (link)
  50. ↑ Van Geit, Werner; Gevaert, Michael; Chindemi, Giuseppe; Rössert, Christian; Courcol, Jean-Denis; Muller, Eilif B.; Schürmann, Felix; Segev, Idan; Markram, Henry (7 June 2016). "BluePyOpt: Leveraging Open Source Software and Cloud Infrastructure to Optimise Model Parameters in Neuroscience". Frontiers in Neuroinformatics. 10: 17. arXiv: 1603.00500 . Bibcode:2016arXiv160300500V. doi: 10.3389/fninf.2016.00017 . PMC   4896051 . PMID   27375471.
  51. ↑ Willett P (1995). "Genetic algorithms in molecular recognition and design". Trends in Biotechnology. 13 (12): 516–521. doi:10.1016/S0167-7799(00)89015-0. PMID   8595137.
  52. ↑ Wong, Ka-Chun; Leung, Kwong-Sak; Wong, Man-Hon (2010). "Protein structure prediction on a lattice model via multimodal optimization techniques". Proceedings of the 12th annual conference on Genetic and evolutionary computation. p. 155. doi:10.1145/1830483.1830513. ISBN   9781450300728. S2CID   14651808.{{cite book}}: |work= ignored (help)
  53. ↑ Wang S, Wang Y, Du W, Sun F, Wang X, Zhou C, Liang Y (2007). "A multi-approaches-guided genetic algorithm with application to operon prediction". Artificial Intelligence in Medicine. 41 (2): 151–159. doi:10.1016/j.artmed.2007.07.010. PMID   17869072.
  54. ↑ "Applying Genetic Algorithms to Recurrent Neural Networks for Learning Network Parameters and Architecture". arimaa.com.
  55. ↑ Bacci, A.; Petrillo, V.; Rossetti Conti, M. (2016). "GIOTTO: A Genetic Code for Demanding Beam-dynamics Optimizations" (PDF). International Particle Accelerator Conference (7th). Joint Accelerator Conferences Website (JACoW). doi:10.18429/JACoW-IPAC2016-WEPOY039. WEPOY039.
  56. ↑ Rossetti Conti, M.; Bacci, A. (2018). "Electron beam transfer line design for plasma driven Free Electron Lasers". Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment. 909: 84–89. arXiv: 1803.00431 . Bibcode:2018NIMPA.909...84R. doi:10.1016/j.nima.2018.02.061. ISSN   0168-9002. S2CID   56365602.
  57. ↑ 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%5B‍%5D
  58. ↑ Wong, Ka-Chun; Leung, Kwong-Sak; Wong, Man-Hon (2010). "Effect of Spatial Locality on an Evolutionary Algorithm for Multimodal Optimization". Applications of Evolutionary Computation. Lecture Notes in Computer Science. Vol. 6024. pp. 481–490. CiteSeerX   10.1.1.655.5490 . doi:10.1007/978-3-642-12239-2_50. ISBN   978-3-642-12238-5.
  59. ↑ Wong, Ka-Chun; Leung, Kwong-Sak; Wong, Man-Hon (2009). "An evolutionary algorithm with species-specific explosion for multimodal optimization". Proceedings of the 11th Annual conference on Genetic and evolutionary computation. p. 923. doi:10.1145/1569901.1570027. ISBN   9781605583259. S2CID   16308189.{{cite book}}: |work= ignored (help)
  60. ↑ Wong, Ka-Chun; Wu, Chun-Ho; Mok, Ricky K.P.; Peng, Chengbin; Zhang, Zhaolei (2012). "Evolutionary multimodal optimization using the principle of locality". Information Sciences. 194: 138–170. doi:10.1016/j.ins.2011.12.016.
  61. ↑ Bagchi Tapan P (1999). Multiobjective Scheduling by Genetic Algorithms. Kluwer Academic. ISBN   978-0-7923-8561-5.
  62. ↑ "Del Moral - Rare events". u-bordeaux1.fr. Archived from the original on 2012-04-23. Retrieved 2011-12-29.
  63. ↑ "a review article". Archived from the original on 2016-04-29. Retrieved 2011-12-29.
  64. ↑ "Del Moral - Optimal Control". u-bordeaux1.fr. Archived from the original on 2012-05-08. Retrieved 2011-12-29.
  65. ↑ BiSNET/e – Distributed Software Systems Group, University of Massachusetts, Boston Archived 2009-06-22 at the Wayback Machine
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.