Publication
Title
An efficient GRASP+VND metaheuristic for the traveling repairman problem
Author
Abstract
The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. To the best of our knowledge, this paper presents one of the first metaheuristic approaches for the traveling repairman problem.
Language
English
Source (series)
Research paper / UA, Faculty of Applied Economics , 2008:8
Publication
Antwerp : UA, Faculty of Applied Economics, 2008
Volume/pages
15 p.
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Affiliation
Publications with a UAntwerp address
External links
Record
Identification
Creation 08.10.2008
Last edited 04.09.2013
To cite this reference