The capacitated Chinese postman problem (CCPP) is one of the most important arc routing problems. This article presents two algorithms adapted to the Canada Post Corporation context (CPC context): a general heuristic for merging cycles (used to group arcs together) and an algorithm to sequence the arcs of a route (Euler's tour with penalties). These two algorithms are tested on postal distribution problems in Canada.
No takes yet. Share an insight, caveat, or question.
Roy et al. (1989) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: