The capacitated arc routing problem is a very important problem with many practical applications. This paper focuses on the large scale capacitated arc routing problem. Traditional solution optimization approaches usually fail because of their poor scalability. The divide-and-conquer strategy has achieved great success in solving large scale optimization problems by decomposing the original large problem into smaller sub-problems and solving them separately. For arc routing, a commonly used divide-and-conquer strategy is to divide the tasks into subsets, and then solve the sub-problems induced by the task subsets separately. However, the success of a divide-and-conquer strategy relies on a proper task division, which is non-trivial due to the complex interactions between the tasks. This paper proposes a novel problem decomposition operator, named the route cutting off operator, which considers the interactions between the tasks in a sophisticated way. To examine the effectiveness of the route cutting off operator, we integrate it with two state-of-the-art divide-and-conquer algorithms, and compared with the original counterparts on a wide range of benchmark instances. The results show that the route cutting off operator can improve the effectiveness of the decomposition, and lead to significantly better results especially when the problem size is very large and the time budget is very tight.

电容电弧布线问题是许多实际应用中非常重要的问题。本文着重于大规模电容弧布线问题。传统的解决方案优化方法通常会因可伸缩性差而失败。通过将原来的大问题分解为较小的子问题并分别解决，分而治之策略在解决大规模优化问题方面取得了巨大成功。对于弧形布线，一种常用的分治策略是将任务分为多个子集，然后分别解决由任务子集引起的子问题。但是，分而治之策略的成功依赖于适当的任务划分，由于任务之间的复杂交互，因此这是不平凡的。本文提出了一种新的问题分解算子，名为路由切断运算符，该运算符以一种复杂的方式考虑了任务之间的交互。为了检查路由截断运算符的有效性，我们将其与两个最新的分治算法进行了集成，并在各种基准实例上与原始对等算法进行了比较。结果表明，路由截断算子可以提高分解的效率，并导致更好的结果，特别是在问题规模很大且时间预算很紧的情况下。并在各种基准实例上与原始同类产品进行了比较。结果表明，路由截断算子可以提高分解的效率，并导致更好的结果，特别是在问题规模很大且时间预算很紧的情况下。并在各种基准实例上与原始同类产品进行了比较。结果表明，路线截断算子可以提高分解的效率，并导致更好的结果，特别是在问题规模很大且时间预算很紧的情况下。