The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhed...

The multi-depot pickup and delivery problem with heterogeneous fleet and soft time windows (MDPDPHSTW) requires to find a minimum cost routing for a fleet vehicles with different capacities and based at different depots, satisfying a given set of customers. A customer request is associated with two locations: a source where a certain demand must be picked up and a destination where this demand ...

This paper studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs...

The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a pickup point and a delivery point. This paper addresses a variant of the PDP where the requests are transportation demands arising from disabled persons. Vehicle passengers can change of vehicle during their trip on specific locations called “transfer points”. Solving this v...

One of the most common combinatorial problems in logistics and transportation applications is the Stacker Crane problem (SCP), where commodities or customers are associated with a pickup location and a delivery location, and the objective is to find a minimum-length tour visiting all locations with the constraint that each pickup location and its associated delivery location are visited in cons...

In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real time. It discusses some general issues as well as solution strategies.

Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. A widely-encountered type of PDP is the Stacker Crane Problem (SCP), where each commodity/customer is associated with a pickup location and a delivery location, and the objective is to find a minimum-length ...

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...