2026-07-22T18:55:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2748 2024-03-06T10:28:42Z ddc:004 open_access

Heuristics for the Traveling Repairman Problem with Profits Dewilde, Thijs Cattrysse, Dirk Coene, Sofie Spieksma, Frits C. R. Vansteenwegen, Pieter Traveling Repairman Profits Latency Tabu Search Relief Efforts 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Thijs Dewilde and Dirk Cattrysse and Sofie Coene and Frits C. R. Spieksma and Pieter Vansteenwegen 2010 Is Part Of OASIcs, Volume 14, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2010.34 urn:nbn:de:0030-drops-27489 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.34 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode