A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

Unnamed Item
Unnamed Item
Branch-and-cut algorithms for the split delivery vehicle routing problem
An iterated local search heuristic for the split delivery vehicle routing problem
Hybrid column generation and large neighborhood search for the dial-a-ride problem
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
On the capacitated vehicle routing problem
A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
An efficient and general approach for the joint order batching and picker routing problem
Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
The split delivery vehicle routing problem with three-dimensional loading constraints
Adaptive large neighborhood search for the commodity constrained split delivery VRP
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
The commodity-split multi-compartment capacitated arc routing problem
Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
A survey of resource constrained shortest path problems: Exact solution approaches
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
A novel approach to solve the split delivery vehicle routing problem
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
Savings by Split Delivery Routing
A heuristic column generation method for the heterogeneous fleet VRP
A Lower Bound for the Split Delivery Vehicle Routing Problem
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Primal Heuristics for Branch and Price: The Assets of Diving Methods
A Primer in Column Generation

This page was built for publication: A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem