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.