Authors
Giuseppe Paletta
Publication date
1992/11/1
Journal
Computers & operations research
Volume
19
Issue
8
Pages
789-795
Publisher
Pergamon
Description
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.
Total citations
Scholar articles
G Paletta - Computers & operations research, 1992