Skip to search formSkip to main contentSkip to account menu

Arc routing

Arc Routing is the process of selecting the best path in a network based on the route. Contrary to normal routing problems, which usually involve… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We describe a compact method to transform arc routing problem instances into node routing problem instances. Any node routing… 
2005
2005
A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local… 
2004
2004
This paper proposes a new transformation of arc routing problems into equivalents node routing problems, with emphasis on the… 
2002
2002
The Capacitated Arc Routing Problem (CARP) is useful for modeling urban waste collection or winter gritting, at the operational… 
2002
2002
Amongst the most important features of supply chain management are those related to interconnecting various companies within a… 
2000
2000
Arc routing problems consist of determining a least cost traversal of some arcs or edges of a graph, subject to side constraints… 
1995
1995
In this paper the Capacitated Chinese Postman Problem, which is a special instance of the general class of Capacitated Arc… 
1990
1990
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific…