Heuristics for the traveling repairman problem with profits

Authors:
T. Dewilde;D. Cattrysse;S. Coene;F. C. R. Spieksma;P. Vansteenwegen
Affiliations:
KU Leuven. University of Leuven, Centre for Industrial Management/Traffic & Infrastructure Celestijnenlaan 300 box 2422, 3001 Leuven, Belgium;KU Leuven. University of Leuven, Centre for Industrial Management/Traffic & Infrastructure Celestijnenlaan 300 box 2422, 3001 Leuven, Belgium;KU Leuven. University of Leuven, Research Group Operations Research and Business Statistics, Belgium;KU Leuven. University of Leuven, Research Group Operations Research and Business Statistics, Belgium;KU Leuven. University of Leuven, Centre for Industrial Management/Traffic & Infrastructure Celestijnenlaan 300 box 2422, 3001 Leuven, Belgium and Ghent University, Department of Industrial Managem ...
Venue:
Computers and Operations Research
Year:
2013

Citing 9
Cited 0

Variable neighborhood search

Computers and Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Traveling Salesman Problems with Profits

Transportation Science
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Routing for Relief Efforts

Transportation Science
Exact algorithms for the minimum latency problem

Information Processing Letters
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation
An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Computers and Operations Research
Profit-based latency problems on the line

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 the properties of this problem, and we derive a mathematical model assuming that the number of nodes to be visited is known in advance. We describe a tabu search algorithm with multiple neighborhoods, we test its performance by running it on instances from the literature and compare the outcomes with an upper bound. We conclude that the tabu search algorithm finds good-quality solutions fast, even for large instances.