Heuristics for the Traveling Repairman Problem with Profits

Authors Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2010.34.pdf
  • Filesize: 403 kB
  • 11 pages

Document Identifiers

Author Details

Thijs Dewilde
Dirk Cattrysse
Sofie Coene
Frits C. R. Spieksma
Pieter Vansteenwegen

Cite AsGet BibTex

Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, and Pieter Vansteenwegen. Heuristics for the Traveling Repairman Problem with Profits. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 34-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/OASIcs.ATMOS.2010.34

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 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.
Keywords
  • Traveling Repairman
  • Profits
  • Latency
  • Tabu Search
  • Relief Efforts

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail