基于中心定位算子的遗传算法

针对遗传算法局部搜索能力弱,求解精度不高的缺陷提出了一种中心定位算子.在进化一定代数(T)后,选择最优的若干个(N)染色体基因来计算中心定位算子,从而确定与中心定位算子相同的基因位,并且在以后的交叉、变异操作中,都不让相同的基因位参与.随着算法的进行,染色体相同的基因位逐渐全部地被确定下来.其次,通过与小生境技术的局部搜索能力算法的结合,提高了该算子的全局优化能力;最后,通过几个非常容易陷入局部最优的测试函数测试表明几乎所有的峰值都得到了理论值.

Genetic algorithm with gene_center_orientation

A gene_center_orientation operator is presented to solve the problem of weak ability and low searching in genetic algorithm.Firstly,the operator is worked out by selecting the several best(N) chromosomes after several generations(T),finding the same genes between the gene_center_otientation and the best(N) chromosomes,and the same genes are not allowed to take part in the subsequent genetic operations such as crossover and mutation.In the process of algorithm,every gene of the same chromosome will be determined.Secondly,the algorithm improves the global optimizing ability of the operator through the combination with the niche technology.Finally,by testing several test functions which are easy to fall into the local optimization,the results show that nearly all of the peak values have reached their theoretical values.