目前第二类广义旅行商问题( GTSP) 求解方法少，仅有的一些方法也存在运算复杂度高等缺陷，为此，文中通过分析距离矩阵的性质，提出了一种重构距离矩阵的算法，将第二类GTSP 转化为第一类GTSP，然后利用混合染色体遗传算法求解转化后的第一类GTSP，从而间接求解了原问题( 第二类GTSP) ．通过转化，大大提高了求解的精度，降低了运算的复杂度．最后，采用文中提出的算法对TSP 问题库内的14 个基准问题构成的第二类GTSP 进行了测试，结果表明该算法可以有效地进行求解．

Considering the lack of solving methods and the high computation complexity of the existing methods ofthe second kind of GTSP ( Generalized Traveling Salesman Problem) ,an algorithm to remodel the distance matrix ispresented by analyzing the characters of distance matrix,which converts the second kind of GTSP into the firstkind,and then solves the converted first kind of GTSP by using the hybrid-chromosome genetic algorithm.Thus,the second kind of GTSP is successfully solved in an indirect mode.The results indicate that the conversion increasesthe solution accuracy and decreases the computation complexity significantly.Moreover,according to the testedresults of the second kind of GTSP composed of 14 benchmark problems from the TSPLIB,it is found that the proposedalgorithm is effective.