Special cases of traveling salesman and repairman problems with time windows

Cover title.Includes bibliographical references (p. 22-23).Supported by the National Science Foundation. ECS-8552419 Supported by the C.S. Draper Laboratories. DL-H-404164John Tsitsiklis

Heuristics for the traveling repairman problem with profits

In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue. We restrict our study to the case of a single server with nodes located in the Euclidean plane. We investigate properties of this problem, and we derive a mathematical model assuming that the number of visited nodes is known in advance. We describe a tabu search algorithm with multiple neighborhoods, and we test its performance by running it on instances based on TSPLIB. We conclude that the tabu search algorithm finds good-quality solutions fast, even for large instances