A MULTIPERIOD TRAVELING SALESMAN PROBLEM - HEURISTIC ALGORITHMS

被引：19
|
作者：
PALETTA, G
机构：
[1] Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, 84081 Baronissi, Sa
来源：
COMPUTERS & OPERATIONS RESEARCH | 1992年 / 19卷 / 08期
关键词：
D O I：
10.1016/0305-0548(92)90018-Z
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper deals with a particular traveling salesman problem in which the cities must be visited on a periodic basis over a given M-day time period. Two heuristic algorithms, embedding a procedure for finding a shortest path on a layered network, are developed. Computational results are also reported for ten test problems drawn from the literature.
引用
收藏
页码：789 / 795
页数：7
相关论文
共 50 条
12345