作　　者： ; ;

机构地区： 广东科学技术职业学院计算机工程技术学院

出　　处： 《东莞理工学院学报》 2007年第5期75-80,共6页

摘　　要： 广义旅行商问题(Generalized Traveling Salesman Problem,简称GTSP)是比旅行商问题(Traveling Salesman Problem,简称TSP)更为复杂的一类组合优化问题,TSP可视为GTSP的特例.GTSP较TSP能提供更精确的实际问题模型,有着更广泛的应用领域,但相对于TSP的研究而言,至今GTSP的研究成果甚少.详细介绍了GTSP问题的定义与背景,应用领域及其求解方法,着重介绍了最新的GCGA算法,并对GTSP未来的研究提出了建议. GTSP （Generalized Traveling Salesman Problem） is a kind of combinatorial optimization problem, which is more complex than TSP. GTSP includes TSP theoretically. GTSP offers a more accurate model than TSP and provides a more ideal modeling tool for many real problems. Therefore, the application fields of GTSP are wider than those of TSP. But the former research on GTSP was very limited compared with those on TSP, In this paper, the definition, background, application fields and the solution of GTSP are introduced, including the latest efficient algorithm GCGA. Finally, some suggestions about the future research on GTSP are proposed.

关 键 词： 广义旅行商 图论 物流 遗传算法

领　　域： [自动化与计算机技术] [自动化与计算机技术]