The snow plow routing problem is an application of the structure of Arc Routing Problems (ARPs) and Vehicle Routing Problems (VRPs) to snow removal that considers roads as edges of a graph.
[2] The Mixed Chinese Postman Problem is applicable to snow routes where directed edges represent one-way streets and undirected edges represent two-way streets.
Vehicle routing and scheduling include snow removal, a postman delivering the mail, meter reading to collect money for the city, school bus routing, garbage waste and refuse collection, and street maintenance.
[1] The snow removal problem is to clear a set roads in a minimum amount of time.
In the public sector, the objective is less often minimizing cost and more often maximizing safety and convenience, for example by reducing the number of left turns on major roads which are hazardous for vehicles to make.