A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
From MaRDI portal
Publication:2026973
DOI10.1016/j.cor.2020.105110OpenAlexW3092606725MaRDI QIDQ2026973
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105110
Related Items (10)
Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ A large neighbourhood search metaheuristic for the contagious disease testing problem ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ The vessel swap-body routing problem ⋮ Green split multiple-commodity pickup and delivery vehicle routing problem ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ Combining an LNS-based approach and organizational mining for the resource replacement problem ⋮ Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation
Uses Software
Cites Work
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- The dial-A-ride problem with transfers
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- An empirical study on the benefit of split loads with the pickup and delivery problem
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Vehicle routing with split deliveries
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Vehicle Routing
- Split delivery routing
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Vehicle routing problems with split deliveries
- A column generation approach for the split delivery vehicle routing problem
- The Pickup And Delivery Problem With Time Windows And Transshipment
This page was built for publication: A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
