Generalized Traveling Salesman Problem and Its Solving
Xi Zhao · Computer Knowledge and Technology · 2007
GTSP (Generalized Traveling Salesman Problem) is a kind of combinatorial optimization problem, which is more complex than TSP. GTSP includes TSP theoretically. The application fields of GTSP are wider than those of TSP. But the former research on GTSP is very limited compared with those on TSP. In this paper, the definition, background, and the Transformation of GTSP into TSP are introduced. At last, the merits and demerits of the Transformation, include some advices about the future research are proposed.