Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Salehipour et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: