We extend the Traveling Repairman Problem (TRP) by assuming a single truck which can stop at customer locations and launch drones multiple times from each stop location to serve customers. The problem is mathematically modeled, several bound analyses are conducted to determine the maximum possible improvements in customer waiting times, and an efficient hybrid Tabu Search-Simulated Annealing algorithm is developed to solve the problem. The results of evaluations on several problem instances suggest that the system can yield considerable reductions in customer waiting time for a wide range of model parameters compared to the conventional delivery models.

中文翻译：

---

带有卡车和无人机的多程交付模型的设计和评估

我们假设一辆卡车可以停在客户地点，并从每个停靠地点多次发射无人机来服务客户，从而扩展了旅行修理工问题（TRP）。对问题进行数学建模，进行了几次边界分析以确定最大可能的客户等待时间改善，并开发了一种有效的混合禁忌搜索-模拟退火算法来解决该问题。对几个问题实例的评估结果表明，与常规交付模型相比，对于各种模型参数，该系统可以显着减少客户的等待时间。