Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.

This thesis considers the Dynamic Pickup and Delivery Problem (DPDP), a dynamic multi-stage vehicle routing problem in which each demand requires two spatially separated services: pickup service at its source location and then delivery service at its destination location. The Dynamic Pickup and Delivery Problem arises in many practical applications, including taxi and courier services, manufact...

Postal logistics has a complex transportation network for efficient mail delivery. Therefore, a postal logistics network consists of various functional sites with a hybrid hub-and-spoke structure. More specifically, there are multiple Delivery & Pickup Stations (D&PSs), multiple Mail Processing Centers (MPCs), and one Exchange Center (EC). In this paper, we develop two mathematical models with ...

This paper presents an alternative methodological approach to O-D matrix and analyses its validity on the viewpoint of Bonnafous’ operability triangle. The proposed model is able to estimate the impacts of urban goods movements in terms of number of vehicles, total travelled distances and road occupancy rates without generating O-D pairs. The originality of the model arises on two main elements...

This paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing prob...

In this paper we introduce a new, pickup and delivery vehicle routing model where weight limits and also packing constraints are taken into account. In the model the vehicles have to transport 3-dimensional boxes from their pickup points into their delivery points. The boxes have weights and the vehicles has to satisfy a weight limit. We present a heuristic algorithm for the solution of the pro...

This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time ...