Arc routing
From Wikipedia, the free encyclopedia
 |
This article may need to be wikified to meet Wikipedia's quality standards. Please help by adding relevant internal links, or by improving the article's layout. (July 2011)
Click [show] on right for more details.
No reason has been cited for the Wikify tag on this article.
|
 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions may be available. (July 2011) |
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.
[edit] External links
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
