The capacitated arc routing problem (CARP) concerns a minimum‐cost set of routes for vehicles that provide service on edges in a given graph while ensuring that the total demand in each route does not exceed the vehicle's capacity. This paper concerns a dynamic variant of the CARP. In particular, it focuses on a problem in which new tasks appear over time. We find that simply increasing the number of iterations of a tabu search algorithm does not always lead to a better solution for a dynamic CARP. This paper investigates how the solution quality can be affected by changing the frequency of updating solutions. Furthermore, we investigate whether or not such effect varies with a method of integrating new tasks into the solution at each update.

中文翻译：

---

动态电容电弧路由问题中更新频率的影响

有容量的弧形路由问题 (CARP) 涉及车辆的最小成本路线集，这些车辆在给定图中的边上提供服务，同时确保每条路线的总需求不超过车辆的容量。本文涉及 CARP 的动态变体。特别是，它关注随着时间的推移出现新任务的问题。我们发现简单地增加禁忌搜索算法的迭代次数并不总是为动态 CARP 带来更好的解决方案。本文研究了如何通过改变更新解决方案的频率来影响解决方案的质量。此外，我们调查了这种影响是否会随着每次更新时将新任务集成到解决方案中的方法而变化。