Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
From MaRDI portal
Publication:2275800
DOI10.1016/j.ejor.2011.03.023zbMath1218.90045OpenAlexW1994408526MaRDI QIDQ2275800
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.023
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (12)
A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times ⋮ Workforce scheduling and routing problems: literature survey and computational study ⋮ An ant colony system for responsive dynamic vehicle routing ⋮ The prisoner transportation problem ⋮ A heuristic approach to a single stage assembly problem with transportation allocation ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ A rollout algorithm for the resource constrained elementary shortest path problem ⋮ A survey of resource constrained shortest path problems: Exact solution approaches
Uses Software
Cites Work
- Unnamed Item
- Scheduling technicians and tasks in a telecommunications company
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- An empirical study on the benefit of split loads with the pickup and delivery problem
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- Vehicle routing with split deliveries
- Effective heuristic procedures for a field technician scheduling problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- Split delivery routing
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- Decomposition Principle for Linear Programs
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- The Split Delivery Vehicle Routing Problem: A Survey
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Savings by Split Delivery Routing
- 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
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Selected Topics in Column Generation
- A column generation approach for the split delivery vehicle routing problem
This page was built for publication: Branch and price for the vehicle routing problem with discrete Split deliveries and time windows