Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
From MaRDI portal
(Redirected from Publication:724007)
Abstract: We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, "pickups and deliveries" and "split deliveries". This possibly leads to optimal solutions of a size that grows exponentially with the instance size, containing multiple visits per customer pair, even in the same route. To solve this problem, we propose an iterated local search metaheuristic as well as a branch-and-price algorithm. The core of the metaheuristic consists of a new large neighborhood search, which reduces the problem of finding the best insertion combination of a pickup and delivery pair into a route (with possible splits) to a resource-constrained shortest path and knapsack problem. Similarly, the branch-and-price algorithm uses sophisticated labeling techniques, route relaxations, pre-processing and branching rules for an efficient resolution. Our computational experiments on classical single-vehicle instances demonstrate the excellent performance of the metaheuristic, which produces new best known solutions for 92 out of 93 test instances, and outperforms all previous algorithms. Experimental results on new multi-vehicle instances with distance constraints are also reported. The branch-and-price algorithm produces optimal solutions for instances with up to 20 pickup-and-delivery pairs, and very accurate solutions are found by the metaheuristic.
Recommendations
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- Split delivery routing
- An iterated local search heuristic for the split delivery vehicle routing problem
Cites work
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- A novel approach to solve the split delivery vehicle routing problem
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
- An empirical study on the benefit of split loads with the pickup and delivery problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Bike sharing systems: solving the static rebalancing problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Notes on the single route lateral transhipment problem
- Real-time split-delivery pickup and delivery time window problems with transfers
- Savings by Split Delivery Routing
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The pickup and delivery problem with time windows
- Vehicle routing problems with split deliveries
Cited in
(14)- Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- Adaptive large neighborhood search for the commodity constrained split delivery VRP
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- Mathematical models for a ship routing problem with a small number of ports on a route
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- Green split multiple-commodity pickup and delivery vehicle routing problem
- An empirical study on the benefit of split loads with the pickup and delivery problem
- A concise guide to existing and emerging vehicle routing problem variants
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
- Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
This page was built for publication: Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724007)
