基于Ahn改进遗传算法的路由优化算法的研究

Research of Routing Optimization Algorithms Based on Ahn Improved Genetic Algorithms

论述了用Ahn改进遗传算法解决路由路径的优化问题,采用可变长度染色体路由串和它的基因节点应用于编码问题,交叉操作在交叉点进行部分染色体部分路由交换,变异操作维持种群的多样性。该算法采用简单维护操作,维护好所有的不可行的染色体。交叉操作和变异操作相结合保证了最优解的搜索能力和解的全局收敛性。计算机仿真实验表明该算法快速有效、可靠性高。

This paper presents an Ahn and their genes are used for encoding crossing sites and the mutation operat with a rate of reproved genetic algorithmic to solve shortest path routing optimizat the problem. The crossover operation exchanges partial chromosomes on problem. Variable-length chromosomes （partial-routes） at positional independent ion maintains the genetic diversity of the population. The algorithm can cure all the infeasible simple repair operation. Crossover and mutation together provide a search capability convergence. Computer simulations have verified that the algorithm is efficient and that results in improved quality of solution effective. chromosomes and enhanced