An efficient GRASP+VND metaheuristic for the traveling repairman problemAn efficient GRASP+VND metaheuristic for the traveling repairman problem
Faculty of Applied Economics
Mathematics, Statistics and Actuarial Sciences
Antwerp :UA, Faculty of Applied Economics, 2008[*]2008
Research paper / UA, Faculty of Applied Economics , 2008:8
University of Antwerp
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.