Some applications of the generalized travelling salesman problem

被引：43

作者：

Laporte, G

AsefVaziri, A

Sriskandarajah, C

机构：

[1] UNIV TORONTO,TORONTO,ON,CANADA

[2] GERAD,MONTREAL,PQ,CANADA

[3] ECOLE HAUTES ETUD COMMERCIALES,MONTREAL,PQ,CANADA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1996年 / 47卷 / 12期

关键词：

generalized traveling salesman problem;

D O I：

10.1057/palgrave.jors.0471204

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In the Generalized Travelling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertices. It is shown that a wide variety of combinatorial optimization problems can be modelled as GTSPs. These problems include location-routeing problems, material flow system design, post-box collection, stochastic vehicle routeing and are routeing.

引用

页码：1461 / 1467

页数：7