进化算法遗传算法.pptxVIP

第1页/共216页优化问题对于一个求函数最大值的优化问题，一般可描述为下述数学规划模型：Soft Computing Lab.第2页/共216页例：无约束单目标，多峰Soft Computing Lab.第3页/共216页约束单目标Soft Computing Lab.第4页/共216页约束多目标Soft Computing Lab.第5页/共216页TSP旅行商问题（TSP,traveling salesman problem）管梅谷教授1960年首先提出，国际上称之为中国邮递员问题。问题描述：一商人去n个城市销货，所有城市走一遍再回到起点，使所走路程最短。（n-1)!/2Soft Computing Lab.第6页/共216页TSPThe one below is length: 33ABCDEA57415B53410C7327D4429E151079 BCEDASoft Computing Lab.第7页/共216页传统最优化面临新挑战：实际问题离散性问题——主要指组合优化不确定性问题——随机性数学模型半结构或非结构化的问题大规模问题：超高维动态优化问题有噪的现代优化方法： 追求满意—近似解 实用性强—解决实际问题Soft Computing Lab.第8页/共216页优化问题的复杂性Complexity: Hard problems and Easy problems When S is small (e.g. 10, 100, or only 1,000,000 or so items), we can simply do so-called exhaustive search(穷举搜索)Exhaustive search: Generate every possible solution, work out its fitness, and hence discover which is best (or which set share the best fitness) 比如从n个数找到最大This is also called Enumeration(列举法）Soft Computing Lab.第9页/共216页问题的复杂度 This is all about characterising how hard it is to solve a given problem. Statements are made in terms of functions of n, which is meant to be some indication of the size of the problem. E.g.:（通过n的一个函数来描述问题的复杂度） Correctly sort a set of n numbers（排序）Can be done in around n log n steps Find the closest pair out of n vectors（从n个向量找出最接近两个)Can be done in O(n2) stepsFind best multiple alignment of n sequences.Can be done in O(2n) steps …Soft Computing Lab.第10页/共216页Polynomial and Exponential ComplexityGiven some problem Q, with `size’ n, imagine that A is the fastest algorithm known for solving that problem exactly. The complexity of problem Q is the time it takes A to solve it, as a function of n. (问题Q的维数为n，A是一个已知快速算法，复杂度就是通过A求解Q所用时间)There are two key kinds of complexity:Polynomial: the dominant term in the expression is polynomial in n. E.g. n34, n.log.n, sin(n2.2), etc … Exponential: the dominant term is exponential in n. E.g. 1.1n, nn+2 , 2n, …Soft Computing Lab.第11页/共216页Polynomial and Exponential Complexity n502345610201001.1n1.211.331.4