This paper is the first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

In the pickup and delivery problem with time windows vehicle routes must be designed to
satisfy a set of transportation requests, each involving a pickup and delivery location, under …

This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem
with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation …

The vehicle routing problem with time windows consists of delivering goods at minimum cost
to a set of customers using an unlimited number of capacitated vehicles assigned to a single …

We present a branch-and-cut-and-price algorithm for the exact solution of a variation of the
vehicle routing problem with time windows in which the transportation fleet is made by …

We present a hybrid optimization algorithm for mixed-integer linear programming,
embedding both heuristic and exact components. In order to validate it we use the periodic …

The unified modeling and solution framework, presented by Desaulniers et al.(Fleet
Management and Logistics. Kluwer Academic, Boston, pp 57–93, 1998), is applicable to …

Usual models that deal with the integration of vehicle routing and cross-docking operations
impose that every vehicle must stop at the dock even if the vehicle collects and delivers the …

The growing cost of transportation and distribution pushes companies, especially small and
medium transportation enterprises, to form partnership and to exploit economies of scale. On …

Abstract The Vehicle Routing Problem with Time Windows consists of computing a minimum
cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers …