《GeneticAlgorithms》.ppt

Basics of Genetic Algorithmsand some possibilities Peter Spijker Technische Universiteit Eindhoven Department of Biomedical Engineering Division of Biomedical Imaging and Modeling California Institute of Technology Materials Process and Simulation Center Biochemistry & Molecular Biophysics November 25, 2003 * 13 12 Presentation Overview Purpose of presentation General introduction to Genetic Algorithms (GA’s) Biological background Origin of species Natural selection Genetic Algorithm Search space Basic algorithm Coding Methods Examples Possibilities Purpose of presentation Optimising parameters of force fields is a difficult and time consuming task Use of optimising methods might be of use Methods: steepest descent simulated annealing (Monte Carlo) genetic algorithms Brief introduction to genetic algorithms in lecture style General Introduction to GA’s Genetic algorithms (GA’s) are a technique to solve problems which need optimization GA’s are a subclass of Evolutionary Computing GA’s are based on Darwin’s theory of evolution History of GA’s Evolutionary computing evolved in the 1960’s. GA’s were created by John Holland in the mid-70’s. Biological Background (1) – The cell Every animal cell is a complex of many small “factories” working together The center of this all is the cell nucleus The nucleus contains the genetic information Biological Background (2) – Chromosomes Genetic information is stored in the chromosomes Each chromosome is build of DNA Chromosomes in humans form pairs There are 23 pairs The chromosome is divided in parts: genes Genes code for properties The posibilities of the genes for one property is called: allele Every gene has an unique position on the chromosome: locus Biological Background (3) – Genetics The entire combination of genes is called genotype A genotype develops to a phenotype Alleles can be either dominant or recessive Dominant alleles will always express from the