| Article ID: | iaor20115756 |
| Volume: | 9 |
| Issue: | 2 |
| Start Page Number: | 189 |
| End Page Number: | 209 |
| Publication Date: | Jun 2011 |
| Journal: | 4OR |
| Authors: | Srensen Kenneth, Brysy Olli, Goos Peter, Salehipour Amir |
| Keywords: | heuristics |
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.