Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries

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 which 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 dropoffs, mandatory pickups, and multiple vehicles.