Research of alloy Orb on a new immune genetic algorithm
The standard Genetic Algorithm has several limitations when dealing with dynamic environments.The most harmful limitation as to do with the tendency for the large majority of the members of a population to convergence prematurely to a particular region of the search space,making thus difficult for the GA to find other solutions when changes in the environment occur.In order to avoid the premature convergence and the slow search efficiency at posterior evolutionary process of the traditional immune genetic algorithm,a new immune genetic algorithm is proposed.This algorithm uses orthogonal crossover to generate initial population and uses elitist-crossover to increase the good patterns of the population and uses hybrid mutation to increase the ability of local and global optimization.It has shown fascinating results when being used in the optimization of multimodal function.
GA immune B-cells hypermutation orthogonal crossover
Shu Zhang
Shenyang University of Chemical Technology Shenyang 110142 ,China
国际会议
太原
英文
500-503
2013-03-22(万方平台首次上网日期,不代表论文的发表时间)