The split delivery vehicle routing problem with three-dimensional loading constraints
From MaRDI portal
Recommendations
- Vehicle routing problems with split deliveries
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
- A novel approach to solve the split delivery vehicle routing problem
Cites work
- A column generation approach for the split delivery vehicle routing problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A model‐based heuristic to the vehicle routing and loading problem
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A unified solution framework for multi-attribute vehicle routing problems
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- An integrated approach to the vehicle routing and container loading problems
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Constraints in container loading -- a state-of-the-art review
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- Improved lower bounds for the split delivery vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- New exact solution approaches for the split delivery vehicle routing problem
- Non-elementary formulations for single vehicle routing problems with pickups and deliveries
- Particle swarm optimization for split delivery vehicle routing problem
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Review: An annotated bibliography of combined routing and loading problems
- Routing problems with loading constraints
- Savings by Split Delivery Routing
- Split delivery routing
- The value of integrating loading and routing
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Vehicle routing problems with split deliveries
- Vehicle routing with split deliveries
Cited in
(21)- An empirical study on the benefit of split loads with the pickup and delivery problem
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- Network scheduling problem with cross-docking and loading constraints
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- The pallet-loading vehicle routing problem with stability constraints
- Freshness-driven vehicle routing problem: modeling and application to the fresh agricultural product pick-storage-transportation
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints
- Heterogeneous instant delivery orders scheduling and routing problem
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- Solution validator and visualizer for (combined) vehicle routing and container loading problems
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints
- A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows
- Beyond fifty years of vehicle routing: insights into the history and the future
- A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
This page was built for publication: The split delivery vehicle routing problem with three-dimensional loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282545)
