Title: Heuristics for the traveling repairman problem with profits
Authors: Dewilde, Thijs ×
Cattrysse, Dirk
Coene, Sofie
Spieksma, Frits
Vansteenwegen, Pieter #
Issue Date: 11-Jan-2013
Series Title: Computers & Operations Research vol:40 issue:7 pages:1700-1707
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 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 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.
ISSN: 0305-0548
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
journal version.pdfmanuscript Published 308KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science