A survey on pickup and delivery problems

Abstract

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, deals with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. This class is denoted as Vehicle Routing Problems with Backhauls (VRPB). Four subtypes can be considered, namely the Vehicle Routing Problem with Clustered Backhauls (VRPCB -all linehauls before backhauls), the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB -any sequence of linehauls and backhauls permitted), the Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP -customers demanding delivery and pickup service can be visited twice), and the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP -customers demanding both services have to be visited exactly once). The second class, dealt with in the second part of this survey, refers to all those problems where goods are transported between pickup and delivery locations. These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride Problem (DARP -passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). Single as well as multi vehicle versions of the mathematical problem formulations are given for all four VRPB types, the corresponding exact, heuristic, and metaheuristic solution methods are discussed. Zusammenfassung Der vorliegende Artikel ist Teil I einer umfassendenÜberblicks-arbeit in zwei Teilenüber pickup and delivery Probleme. Grundsätzlich können zwei Problemklassen unterschieden werden. Die erste Problemklasse, mit der sich dieser Artikel befasst, beinhaltet all jene Probleme, die Auslieferungen von einem Depot zu Auslieferungs-Kunden (linehaul customers) und Abholungen von Rück-ladungs-Kunden (backhaul customers) zu einem Depot behandeln. Diese Problemklasse wird im Folgenden als Vehicle Routing Problems with Backhauls (VRPB) bezeichnet. Vier verschiedene Problemtypen können weiters unterschieden werden: das Vehicle Routing Problem with Clustered Backhauls (VRPCB), alle Auslieferungen müssen vor den Abholungen durchgeführt werden, das Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB), gemischte Ausliefer-und Abholsequenzen sind gestattet, das Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP), Kunden, die Ausliefer-und Abholservice verlangen, können zweimal besucht werden, und das Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP), Kunden, die beide Services verlangen, können nur genau einmal angefahren werden. Die zweite pickup and delivery Problemklasse wird in Teil II dieser Arbeit behandelt. Sie beinhaltet all jene Problemtypen, die sich mit Transporten zwischen Abhol-und Auslieferungsorten befassen: das Pickup and Delivery Vehicle Routing Problem (PD...

Optimizing for Transfers in a Multi-vehicle Collection and Delivery Problem

“…A plethora of approaches have been proposed to solve the PDP, including branch and bound methods, heuristics, and metaheuristics [3,16]. The Collection and Delivery Problem (CDP) is a subproblem of the PDP in which there is only a single delivery point.…”

Markov-based redistribution policy model for future urban mobility networks

“…Load balancing in MOD systems is similar to the Pickup and Delivery problem (PDP), whereby passengers arriving into a network are transported to a delivery site by vehicles. For a review of the state of the art see [2], [10] and the references therein. Autonomous load rebalancing in MOD systems has recently been studied in [11] and [12], where a fluid model was used to represent supply and demand.…”

Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows

“…Most of the exact methods proposed for the PDPTW are versions of branch and cut and/or branch and price (Berbeglia et al 2007;Parragh et al 2008). Branch and price is a branch and bound approach where each node in the branch and bound tree is solved using column generation.…”

“…For example, PDP with transfers (Masson et al 2012), PDP with LIFO loading (Cherkesly et al 2015), single vehicle PDP (Gendreau et al 1999;Kammarti et al2004) and dynamic PDP (Gendreau et al 2006). For further reading on PDP there are also several survey and overview papers (Battarra et al 2014;Berbeglia et al 2007;Parragh et al 2008;Savelsbergh and Sol 1995).…”