The number of arc routing publications has increased significantly in the last decade. Such
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …

We consider a vehicle routing problem which seeks to minimize cost subject to service level
constraints on several groups of deliveries. This problem captures some essential …

The Capacitated Arc Routing Problem (CARP) stands among the hardest combinatorial
problems to solve or to find high quality solutions. This becomes even more true when …

Vehicle routing algorithms usually reformulate the road network into a complete graph in
which each arc represents the shortest path between two locations. Studies on time …

The current best exact algorithms for the Capacitated Arc Routing Problem are based on the
combination of cut and column generation. This work presents a deep theoretical …

9.1▪ Introduction The Capacitated Arc Routing Problem (CARP) was formally introduced by
Golden and Wong [46] in 1981. Roughly speaking, the CARP consists of finding a set of …

We study the mixed capacitated general routing problem (MCGRP) in which a fleet of
capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph …

Abstract We introduce the Set Team Orienteering Problem (STOP), a generalised variant of
the Set Orienteering Problem (SOP), in which customer locations are split into multiple …

We describe a compact method to transform arc routing problem instances into node routing
problem instances. Any node routing problem instance thus created must be solved by a …

Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the
capacitated arc-routing problem. Oper. Res. 60 (5): 1167–1182] presented a cut-first branch …