Branch-and-Cut and Iterated Local Search for the Weighted k-Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras

Private enterprises and governments around the world use speed cameras to control traffic flow and limit speed excess. Cameras may be exposed to difficult weather conditions and typically require frequent maintenance. When deciding the order in which maintenance should be performed, one has to consider both the traveling times between the cameras and the traffic flow that each camera is supposed to monitor. In this paper, we study the problem of routing a set of technicians to repair cameras by minimizing the total weighted latency, that is, the sum of the weighted waiting times of each camera, where the weight is a parameter proportional to the monitored traffic. The resulting problem, called the weighted k-traveling repairman problem (wkTRP), is a generalization of the well- known traveling repairman problem and can be used to model a variety of real-world applications. To solve the wkTRP, we propose an iterated local search heuristic and an exact branch-and-cut algorithm enriched with valid inequalities. The effectiveness of the two methods is proved by extensive computational experiments performed both on in- stances derived from a real-world case study and on benchmark instances from the literature on the wkTRP and on related problems.