Major advances were recently obtained in the exact solution of vehicle routing problems
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …

Vehicle routing problems have drawn researchers' attention for more than 50 years. Most
approaches found in the literature address these problems using the so‐called customer …

The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and
challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an …

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 …

This work studies a soft-clustered capacitated arc routing problem that extends the classical
capacitated arc routing problem with an important constraint. The problem has a set of …

The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem
that has been intensively studied in the last decades. We present a hybrid metaheuristic …

The clustered vehicle-routing problem is a variant of the classical capacitated vehicle-
routing problem in which customers are partitioned into clusters, and it is assumed that each …

This chapter overviews the most relevant contributions on location-routing problems.
Although there exist several models where location and routing decisions must be made in …

This article explores a structural neighborhood decomposition for arc routing problems, in
which the decisions about traversal orientations during services are made optimally as part …

In this paper, we present a new branch-and-price-and-cut algorithm to solve the truck-and-
trailer routing problem with time windows (TTRPTW) and two real-world extensions. In all …