Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

0.00 Avg rating0 Votes
Article ID: iaor20115756
Volume: 9
Issue: 2
Start Page Number: 189
End Page Number: 209
Publication Date: Jun 2011
Journal: 4OR
Authors: , , ,
Keywords: heuristics
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. This paper presents the first metaheuristic approach for the traveling repairman problem.

Reviews

Required fields are marked *. Your email address will not be published.