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

共 11 条

[1] THE PERIOD ROUTING PROBLEM [J].

CHRISTOFIDES, N ;

BEASLEY, JE .

NETWORKS, 1984, 14 (02) :237-256

[2]

ELION S, 1971, DISTRIBUTION MANAGEM

[3]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[4]

GAUDIOSO M, IN PRESS TRANSPORTAT

[5]

Lawler E. L., 1985, WILEY INTERSCIENCE S

[6] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[7] OPTIMAL DISTRIBUTION STRATEGIES WITH CYCLIC DEMANDS [J].

LUCERTINI, M ;

PALETTA, G .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 27 (03) :324-331

[8]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

[9]

Rosenkrantz D. H., 1977, SIAM Journal on Computing, V6, P563, DOI 10.1137/0206041

[10] ASSIGNMENT ROUTING PROBLEM [J].

RUSSELL, R ;

IGO, W .

NETWORKS, 1979, 9 (01) :1-17

← 1 2 →