A decade of Capacitated Arc Routing

75Citations
Citations of this article
62Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Arc Routing is the arc counterpart to node routing in the sense that focus regarding service and resource constraints are on the arcs and not on the nodes. The key problem within this area is the Capacitated Arc Routing Problem (CARP), which is the arc routing counterpart to the vehicle routing problem. During the last decade, arc routing has been a relatively active research area with respect to lower bounding procedures, solution approaches and modeling. Furthermore, several interesting variations of the problem have been studied. We survey the latest research within the area of arc routing focusing mainly on the CARP and its variants. © Springer Science+Business Media, LLC 2008.

Author supplied keywords

Cite

CITATION STYLE

APA

Wøhlk, S. (2008). A decade of Capacitated Arc Routing. Operations Research/ Computer Science Interfaces Series, 43, 29–48. https://doi.org/10.1007/978-0-387-77778-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free