The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
From MaRDI portal
Publication:2029026
DOI10.1016/j.ejor.2020.07.032zbMath1487.90182OpenAlexW3045470676MaRDI QIDQ2029026
David Wolfinger, Juan-José Salazar-González
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.032
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (7)
A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Heterogeneous instant delivery orders scheduling and routing problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation ⋮ Mathematical models for a ship routing problem with a small number of ports on a route ⋮ A branch-and-price algorithm for solving the single-hub feeder network design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Vehicle routing with cross-dock selection
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- The precedence-constrained asymmetric traveling salesman polytope
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Vehicle Routing
- Split delivery routing
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Vehicle routing problems with split deliveries
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- 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: The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
