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
A multiperiod traveling salesman problem: Heuristic Algorithms
PALETTA, Giuseppe
1992-01-01
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 literatureFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
