Jump to content

Arc routing

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ta-terrestris (talk | contribs) at 20:45, 2 November 2007 (←Created page with 'Arc Routing defines a routing problem regarding the route, not the nodes. Normaly routing algorithms aim to optimize the way from one node to another, arc routing p...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Arc Routing defines a routing problem regarding the route, not the nodes. Normaly 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.

More to follw, just started googling info together....

Some links: Arc Ruting Problems
Tourenplanung

Retrieved from "https://en.wikipedia.org/w/index.php?title=Arc_routing&oldid=168804546"