Abstract
We study the class of one-to-many-to-one single vehicle routing problems with pickups and deliveries, in which a single capacitated vehicle is used to serve a set of customers requiring a delivery, a pickup, or both. These problems have many real-world applications, including beverage distribution, courier service transportation, and reverse logistics. We first concentrate on a well-studied problem in this class, known as the single vehicle routing problem with deliveries and selective pickups (SVRPDSP), in which deliveries are mandatory but pickups are optional and generate a revenue if performed, and customers requiring both a delivery and a pickup (combined demand) can be visited either once or twice. Most exact algorithms in the literature solve SVRPDSP by looking for elementary tours on an extended network that is obtained by transforming each combined demand customer into two different customers, one requiring only the delivery and the other one only the pickup. Because this can result in a significant loss in performance, in this work we focus instead on the original problem network and present formulations that can yield non-elementary tours. Through the use of Benders decomposition, valid inequalities, and tailored optimization techniques based on branch-and-cut frameworks, we develop exact algorithms that outmatch previous results in the literature and obtain proven optimal solutions for all benchmark instances. We then generalize the algorithms to solve several other vehicle routing problems with pickups and deliveries, including the cases of split deliveries, intermediate drop-offs, mandatory pickups, and multiple vehicles. The online appendix is available at https://doi.org/10.1287/opre.2017.1639 .
Highlights
This article addresses a large class of pickup and delivery routing problems, where a single vehicle leaves the depot to perform both a series of deliveries of a first commodity and a series of collections of a second commodity which is brought back to the depot
We study the class of one-to-many-to-one single vehicle routing problems with pickups and deliveries, in which a single capacitated vehicle is used to serve a set of customers requiring a delivery, a pickup, or both
The same holds for Benders-based non-Elementary (BBNE) and two-index non-Elementary (TINE), as they are equivalent to two-commodity non-Elementary (TCNE)
Summary
This article addresses a large class of pickup and delivery routing problems, where a single vehicle leaves the depot to perform both a series of deliveries of a first commodity and a series of collections of a second commodity which is brought back to the depot. These problems are known as oneto-many-to-one single vehicle pickup and delivery problems (1-M-1 SVPDPs), see Berbeglia et al. (2007) and Gribkovskaia and Laporte (2008), and are among the most important problems in the large area of pickup and delivery because they can model many real-world situations. The relevant literature has focused on two classes of problems:
Sign-in/Register to view highlights & summary 
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call