A districting-based heuristic for the coordinated capacitated arc routing problem.

•We consider a routing problem arising in garbage collection.•A complicating factor is coordination of collection of several garbage types.•The problem is of large-scale and real life data from Denmark is used.•We create districts corresponding to specific weekdays for garbage collection.•We develop a constructive heuristic for solving the problem.