Branch-and-cut algorithms for the split delivery vehicle routing problem

DOI10.1016/j.ejor.2014.04.026zbMath1338.90042OpenAlexW2057532434MaRDI QIDQ296858

F. Blanchet-Sadri, M. Dambrine

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

zbMATH Keywords

branch-and-cutsplit delivery vehicle routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (21)

Classification, models and exact algorithms for multi-compartment delivery problems ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Exactly solving packing problems with fragmentation ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ The travelling salesman problem with positional consistency constraints: an application to healthcare services ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ Particle Swarm Optimization for Split Delivery Vehicle Routing Problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ A multi-compartment vehicle routing problem in cold-chain distribution ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Bin packing problem with conflicts and item fragmentation ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ Two-echelon vehicle routing problems: a literature review ⋮ The multiphase course timetabling problem

Uses Software

• VRP
• MAXFLOW

Cites Work

• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• 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
• On the capacitated vehicle routing problem
• Split delivery routing
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Savings by Split Delivery Routing
• A Lower Bound 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 column generation approach for the split delivery vehicle routing problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Branch-and-cut algorithms for the split delivery vehicle routing problem