Arc routing
From Wikipedia, the free encyclopedia
Arc routing defines a routing problem regarding the route, not the nodes. Normally routing algorithms aim to optimize the way from one node to another, arc routing problems involve finding the most efficient way to cover a complete network in a most effective manner, e.g. for a snowplough. The result of an arc routing problem is a route covering all parts of a network with the minimal amount of deadheading.
