求解旅行商问题的一种混合遗传算法

A Hybrid Algorithm to Traveling Salesman Problem

文章针对组合优化中的旅行商问题,设计了将溶入最近邻算法思想的混合遗传算法。它的特点在于用具有最邻近结构的基因片段完成个体的替代;目的在于修正部分适应度偏低的染色体,提高群体的平均适应度。

To the traveling salesman problem in combianational optomization,this paper designs a hybrid genetic algo-rithm with the idea of nearest neighborhood.Using neighborhood segment to impelement individual substitution to correct the chromosome ,whose adaptability is low,in transforming of decode.And the average adatability of the conony is im-proved.