遗传算法原理与应用的.pptVIP

遗传算法原理与应用;提纲;一、遗传算法概述;1、智能优化算法 ;常用的智能优化算法 ;智能优化算法的特点;遗传算法起源 ;遗传算法的搜索机制 ;2、基本遗传算法;基本遗传算法的组成 ; 编码 ;函数优化示例 ;SGA对于本例的编码 ;几个术语 ;初始种群 ; 适应度函数 ;选择算子;轮盘赌选择方法;轮盘赌选择方法的实现步骤;交叉算子 ;单点交叉运算 ;变异算子 ;基本位变异算子 ;基本位变异算子的执行过程 ;运行参数 ;SGA的框图 ;3、遗传算法的特点 ;二、遗传算法原理;1、遗传算法的数学基础;模式;两个定义;模式的阶和定义距的含义;模式定理;模式定理;积木块假设 ;2、遗传算法的收敛性分析;种群规模对收敛性的影响;选择操作对收敛性的影响;交叉概率对收敛性的影响;变异概率对收敛性的影响;遗传算法的本质 ;3、遗传算法的改进;遗传算法的改进途径;对编码方式的改进;对遗传算子 的改进;对遗传算子 的改进;对遗传算子 的改进;对控制参数的改进;对控制参数的改进;对执行策略的改进;三、遗传算法的应用;1、遗传算法的应用领域;遗传算法应用于组合优化;Coding and Decoding; For Base-2 and Base-10:;Crossover Operator;Mutation Operator;Example 1 (Function Optimization) ;Step 1. Convert the binary string x = xl,..., x2, x1 from base 2 to;Example 2 (Pattern Recognition) ;Initialization;As the goal is to generate individuals that are as similar as possible to the target individual, a straightforward way of determining fitness is by counting the number of similar bits between each individual of the population and the target individual. The number of different bits between two bitstrings is termed Hamming distance. For instance, the vector h of Hamming distances between the individuals of P and the target individual is: h = [6,7,9,5,5,4,6,7].;The fitness of the population can be measured by subtracting the length l = 12 of each individual by its respective Hamming distance to the target individual. Therefore, the vector of fitnesses becomes: f = [f1, f2, f3, f4, f5, f6, f7, f8] = [6,5,3,7,7,8,6,5]. The ideal individual is the one whose fitness is f = 12. Therefore, the aim of the search to be performed by the GA is to maximize the fitness of each individual, until (at least) one individual of P has fitness f = 12.;;