Branch and price for the vehicle routing problem with discrete Split deliveries and time windows

DOI10.1016/J.EJOR.2011.03.023MaRDI QIDQ2275800zbMATH OpenOpenAlexFDO

Authors Matteo Salani, Ilaria Vacca

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

zbMATH Keywords

branch and pricecolumn generationdantzig-Wolfe decompositionSplit deliveryvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows
• A column generation approach for the split delivery vehicle routing problem
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A column generation approach for the split delivery vehicle routing problem
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• An empirical study on the benefit of split loads with the pickup and delivery problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Branch-and-price: Column generation for solving huge integer programs
• Decomposition Principle for Linear Programs
• Effective heuristic procedures for a field technician scheduling problem
• scientific article; zbMATH DE number 1749220 (Why is no real title available?)
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Savings by Split Delivery Routing
• Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
• Scheduling technicians and tasks in a telecommunications company
• Selected Topics in Column Generation
• Split delivery routing
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• The split delivery vehicle routing problem: A survey
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Vehicle routing with split deliveries

Cited in

(22)

• Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• The prisoner transportation problem
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
• A survey of resource constrained shortest path problems: exact solution approaches
• Workforce scheduling and routing problems: literature survey and computational study
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• An ant colony system for responsive dynamic vehicle routing
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
• A heuristic approach to a single stage assembly problem with transportation allocation
• A rollout algorithm for the resource constrained elementary shortest path problem
• Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
• Vehicle routing problems with multiple commodities: a survey
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• A problem reduction based memetic algorithm for the vehicle routing problem with discrete split deliveries and pickups
• An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Branch and price for the vehicle routing problem with discrete Split deliveries and time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275800)