A multiperiod traveling salesman problem: Heuristic algorithms

A multiperiod traveling salesman problem: Heuristic algorithms

0.00 Avg rating0 Votes
Article ID: iaor1993389
Country: United Kingdom
Volume: 19
Issue: 8
Start Page Number: 789
End Page Number: 795
Publication Date: Nov 1992
Journal: Computers and Operations Research
Authors:
Keywords: graphs, heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.