A NEW HEURISTIC FOR THE PERIOD TRAVELING SALESMAN PROBLEM

被引：22

作者：

CHAO, IM

GOLDEN, BL

WASIL, EA

机构：

[1] UNIV MARYLAND,COLL BUSINESS & MANAGEMENT,COLLEGE PK,MD 20742

[2] AMERICAN UNIV,KOGOD COLL BUSINESS ADM,WASHINGTON,DC 20016

来源：

COMPUTERS & OPERATIONS RESEARCH | 1995年 / 22卷 / 05期

关键词：

D O I：

10.1016/0305-0548(94)00031-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, a new heuristic for the period traveling salesman problem is presented. Our heuristic is fast and simple and has improved upon previous best-known solutions. In addition, we have generated a variety of challenging, new test problems. Our new heuristic is shown to perform well on these new problems.

引用

页码：553 / 565

页数：13

共 11 条

[1]

CHAO I, 1993, THESIS U MARYLAND CO

[2] THE PERIOD ROUTING PROBLEM [J].