cn01-IntroGA-v遗传算法.ppt

1. Introduction to Genetic Algorithms;优化问题;例：无约束单目标，多峰;约束单目标;约束多目标;TSP;优化问题的复杂性;问题的复杂度;Polynomial and Exponential Complexity;Polynomial and Exponential Complexity;;polynomial;随机算法：爬山法; ;易陷入局部最优;1. Introduction of Genetic Algorithms;1. Introduction of Genetic Algorithms;1. Introduction of Genetic Algorithms;进化论;Lamarck 进化论;Darwin 进化论;孟德尔学说 ;;比较;新达尔文主义;;生物学中的遗传概念;生物学中的遗传概念;Evolution as Problem Solving;Evolution as a Problem Solving Method; Lesson1: Keep a population/collection of different things on the go. Lesson2: Select `parents’ with a relatively weak bias towards the fittest. It’s not really plain survival of the fittest, what works is the fitter you are, the more chance you have to reproduce, and it works best if even the least fit still have some chance. （无偏见的选择父代，或适者生存) Lesson3: It can sometimes help to use recombination of two or more `parents’ – I.e. generate new candidate solutions by combining bits and pieces from different previous solutions. 通过重组将父代优良基因遗传给后代;More like selective breeding than natural evolution;Initial population;Select;Crossover;Another Crossover;A mutation;Another Mutation;Old population + children;New Population: Generation 2;Generation 3;Generation 4, etc …;;遗传算法的基本思想;;遗传算法历史;遗传算法历史;遗传算法历史;产生初 始种群;1.3 Major Advantages;遗传算法;;;;Soft Computing Lab.;1.1 Introduction of Genetic Algorithms;1.2 General Structure of Genetic Algorithms;1.2 General Structure of Genetic Algorithms;1.2 General Structure of Genetic Algorithms;1.2 General Structure of Genetic Algorithms;1. Introduction of Genetic Algorithms;2. Example with Simple Genetic Algorithms ;2. Example with Simple Genetic Algorithms;2.1 Representation;2.1 Representation;2.1 Representation;2.1 Representation;input: substringj output: a real number xj ;2.2 Initial Population;2.3 Evaluation;An evaluation function plays the role of the environment, and it rates chrom