Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,464 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Branch and cut
Convex hull
Integer programming
Routing
Expand
Broader (1)
Travelling salesman problem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A compact transformation of arc routing problems into node routing problems
L. Foulds
,
Humberto J. Longo
,
J. P. Martins
Annals of Operations Research
2015
Corpus ID: 7711634
We describe a compact method to transform arc routing problem instances into node routing problem instances. Any node routing…
Expand
2005
2005
Efficient heuristics for the Rural Postman Problem
GW Groves
,
Jh van Vuuren
2005
Corpus ID: 55760671
A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local…
Expand
2004
2004
Exact methods based on node routing formulations for arc routing problems
Roberto Baldacci
,
V. Maniezzo
2004
Corpus ID: 6125344
This paper proposes a new transformation of arc routing problems into equivalents node routing problems, with emphasis on the…
Expand
2002
2002
Evolutionary Algorithms for Multiperiod Arc Routing Problems
P. Lacomme
2002
Corpus ID: 14427310
The Capacitated Arc Routing Problem (CARP) is useful for modeling urban waste collection or winter gritting, at the operational…
Expand
2002
2002
A hierarchical relaxations lower bound for the capacitated arc routing problem
A. Amberg
,
S. Voß
Proceedings of the Annual Hawaii International…
2002
Corpus ID: 1874770
Amongst the most important features of supply chain management are those related to interconnecting various companies within a…
Expand
2000
2000
Heuristics for the Mixed Rural Postman Problem
Á. Corberán
,
R. Martí
,
Antonio Romero
Computers & Operations Research
2000
Corpus ID: 39865576
2000
2000
A Historical Perspective on Arc Routing
H. A. Eiselt
,
G. Laporte
2000
Corpus ID: 59883985
Arc routing problems consist of determining a least cost traversal of some arcs or edges of a graph, subject to side constraints…
Expand
1998
1998
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
P. F. Córdoba
,
L. Garcia-Raffi
,
J. Sanchis
Computers & Operations Research
1998
Corpus ID: 32053372
1995
1995
Computational Experiments with Heuristics for a Capacitated Arc Routing Problem
Peter Greistorfer
1995
Corpus ID: 117558832
In this paper the Capacitated Chinese Postman Problem, which is a special instance of the general class of Capacitated Arc…
Expand
1990
1990
The capacitated arc routing problem. A heuristic algorithm
E. Benavent
,
V. Campos
,
Á. Corberán
,
E. Mota
1990
Corpus ID: 122468972
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required