We describe a weighted version of the k-Chinese and k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall take care of each link and how the vehicles shall travel between links. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usable substructures, such as heuristics for rural postman problems, meta-heuristics, k-means clustering and local search improvements by moving cycles. The methods have been implemented and tested on real life examples.