Sciweavers

ATMOS
2010

Heuristics for the Traveling Repairman Problem with Profits

13 years 18 days ago
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. 1998 ACM Subject Classification I.2.8 Heuristic Methods Keywords and phrases Traveling Repairman, Profits, Latency, Tabu Search, Relief Efforts Digital Object Identifier 10.4230/OASIcs.ATMOS.2010.34
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where ATMOS
Authors Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen
Comments (0)