Branch-and-cut algorithms for the split delivery vehicle routing problem
From MaRDI portal
Publication:296858
DOI10.1016/J.EJOR.2014.04.026zbMATH Open1338.90042OpenAlexW2057532434MaRDI QIDQ296858FDOQ296858
Authors: C. Archetti, Nicola Bianchessi, Maria Grazia Speranza 
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.026
Recommendations
- A column generation approach for the split delivery vehicle routing problem
- New exact solution approaches for the split delivery vehicle routing problem
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Split delivery routing
- Savings by Split Delivery Routing
- On the capacitated vehicle routing problem
- Title not available (Why is that?)
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- 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
- A ring-based diversification scheme for routing problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
Cited In (32)
- Classification, models and exact algorithms for multi-compartment delivery problems
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
- New exact solution approaches for the split delivery vehicle routing problem
- A branch-and-cut embedded matheuristic for the inventory routing problem
- The travelling salesman problem with positional consistency constraints: an application to healthcare services
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A column generation approach for the split delivery vehicle routing problem
- Two-echelon vehicle routing problems: a literature review
- A hybrid VND method for the split delivery vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- A multi-compartment vehicle routing problem in cold-chain distribution
- Improved lower bounds for the split delivery vehicle routing problem
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- The multiphase course timetabling problem
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Exactly solving packing problems with fragmentation
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
- Particle swarm optimization for split delivery vehicle routing problem
- An exact approach 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 tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries
- Bin packing problem with conflicts and item fragmentation
- The split delivery vehicle routing problem with three-dimensional loading constraints
Uses Software
This page was built for publication: Branch-and-cut algorithms for 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 Q296858)
