摘要
广义旅行商问题（Generalized Traveling Salesman Problem，简称GTSP）是比旅行商问题（Traveling Salesman Problem，简称TSP）更为复杂的一类组合优化问题，TSP可视为GTSP的特例。GTSP的应用领域更广，但相对于TSP的研究而言，GTSP的研究成果很少。本文介绍了GTSP问题的定义与背景，研究了GTSP与TSP的转化，提出了转化的优缺点和研究方向。
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.
作者
赵曦
ZHAO Xi （College of Computer Science and Engineering, Guangdong Institute of Science and Technology, Guangzhou 510640,China）
出处
《电脑知识与技术》
2007年第3期1334-1335,共2页
Computer Knowledge and Technology
