A New Mathematical Model for the Traveling Repairman Problem

We propose a new mixed-integer program for the traveling repairman problem (TRP). The model benefits from the position-based variables. We aim to utilize only available solvers for optimizing the model. We test the proposed model by solving 70 randomly generated instances, ranging from 10 to 50 vertices, from the literature by CPLEX, and comparing its solutions with those of available models from the literature. We show that our model delivers the largest number of best solutions and that in a shorter time.