A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem
针对k-旅行修理工问题，提出了一种新的混合整数规划模型和高效元启发式算法，能快速求解大规模实例，在389个测试实例中386个达到最优解。
In this paper, we study a k-Travelling Repairmen Problem where the objective is to minimize the sum of clients waiting time to receive service. This problem is relevant in applications that involve distribution of humanitarian aid in disaster areas, delivery and collection of perishable products and personnel transportation, where reaching demand points to perform service, fast and fair, is a priority. This paper presents a new mixed integer formulation and a simple and efficient metaheuristic algorithm. The proposed formulation consumes less computational time and allows solving to optimality more than three times larger data instances than the previous formulation published in literature, even outperforming a recently published Branch and Price and Cut algorithm for this problem. The proposed metaheuristic algorithm solved to optimality 386 out of 389 tested instances in a very short computational time. For larger instances, the algorithm was assessed using the best results reported in the literature for the Cumulative Capacitated Vehicle Routing Problem.