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

DOI10.1016/J.EJOR.2014.04.026MaRDI QIDQ296858zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 1849127 (Why is no real title available?)
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A column generation approach for the split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A ring-based diversification scheme for routing problems
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• An adaptive memory algorithm for the split delivery vehicle routing problem
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Improved lower bounds for the split delivery vehicle routing problem
• On the capacitated vehicle routing problem
• Savings by Split Delivery Routing
• Split delivery routing
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Vehicle routing problems with split deliveries

Cited in

(32)

• Classification, models and exact algorithms for multi-compartment delivery problems
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• 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
• Two-echelon vehicle routing problems: a literature review
• A concise guide to existing and emerging vehicle routing problem variants
• A hybrid VND method for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem
• 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
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• Exactly solving packing problems with fragmentation
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
• 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 tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• 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
• Bin packing problem with conflicts and item fragmentation
• The split delivery vehicle routing problem with three-dimensional loading constraints
• A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries

Describes a project that uses

Uses Software

• MAXFLOW
• VRP

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)