We address the well-known Capacitated Arc-Routing Problem (CARP).
We combine Column Generation (CG) and Iterated Local Search (ILS).
First a general framework based on Permutation Set Covering is defined.
The permutation space is explored both by ILS and CG that run in parallel.