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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem… (More)
Is this relevant?
2014
2014
In this paper, a divide-and-conquer approach is proposed to solve the large-scale capacitated arc routing problem (LSCARP) more… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
2012
2012
This work introduces a synchronized arc routing problem arising from a real-world application in snow plowing. The problem… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications… (More)
  • figure 1
  • figure 2
  • table III
  • table II
  • table V
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The capacitated arc routing problem (CARP) has attracted much attention during the last few years due to its wide applications in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper proposes a variable neighborhood descent for solving a capacitated arc routing problem with time-dependent service… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
The capacitated arc routing problem (CARP) involves the routing of vehicles to treat a set of arcs in a network. In many… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2005
2005
In this dissertation, mainly two problems are considered, both of which are routing problems. The first part of the dissertation… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Competitive memetic algorithms for arc routing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?