Abstract This paper addresses a technician routing and scheduling problem motivated by an application for the repair and maintenance of electronic transactions equipment. The problem exhibits many special features like multiple time windows for service, an inventory of spare parts carried by each technician and tasks that may require a special part to be performed. A problem-solving methodology based on tabu search, coupled with an adaptive memory, is proposed. The inclusion of solutions (local minima) in the adaptive memory takes into account both quality and diversity. Results are reported on test instances with up to 200 tasks. A comparison with a previously developed branch-and-price algorithm is also reported on instances of small size.

中文翻译：

---

一种基于禁忌搜索的元启发式求解技术员路由和调度问题

摘要 本文解决了由电子交易设备维修和维护应用程序驱动的技术人员路由和调度问题。该问题表现出许多特殊特征，例如多个服务时间窗口、每个技术人员携带的备件库存以及可能需要执行特殊部件的任务。提出了一种基于禁忌搜索和自适应记忆的问题解决方法。在自适应记忆中包含解决方案（局部最小值）考虑了质量和多样性。结果报告在包含多达 200 个任务的测试实例上。还报告了对小规模实例与先前开发的分支和价格算法的比较。