A novel approach to solve the split delivery vehicle routing problem
From MaRDI portal
Publication:2968484
DOI10.1111/ITOR.12250zbMATH Open1358.90015OpenAlexW2309764699MaRDI QIDQ2968484FDOQ2968484
Authors: Ping Chen, Bruce Golden, Xingyin Wang, Edward Wasil 
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12250
Recommendations
- A column generation approach for the split delivery vehicle routing problem
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
- A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes
- New exact solution approaches for the split delivery vehicle routing problem
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A library of local search heuristics for the vehicle routing problem
- Split delivery routing
- Savings by Split Delivery Routing
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- A column generation approach for the split delivery vehicle routing problem
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
Cited In (19)
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- New exact solution approaches for the split delivery vehicle routing problem
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- The split delivery vehicle routing problem: A survey
- A hybrid VND method for the split delivery vehicle routing problem
- A ring-based diversification scheme for routing problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- An overview on the split delivery vehicle routing problem
- Particle swarm optimization for split delivery vehicle routing problem
- Using regression models to understand the impact of route-length variability in practical vehicle routing
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Uses Software
This page was built for publication: A novel approach to solve the split delivery vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968484)
