A column generation approach for the split delivery vehicle routing problem

DOI10.1002/net.20467zbMath1231.90074MaRDI QIDQ5894493

Nicola Bianchessi, Claudia Archetti, Maria Grazia Speranza

Publication date: 18 January 2012

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

column generationsplit delivery vehicle routing problembranch-and-price-and-cut methodunlimited and limited fleet

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) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Branch-and-cut algorithms for the split delivery vehicle routing problem, An iterated local search heuristic for the split delivery vehicle routing problem, A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach, 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, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, A novel approach to solve the split delivery vehicle routing problem, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, New exact solution approaches for the split delivery vehicle routing problem, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, Directed weighted improper coloring for cellular channel allocation, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, The split delivery vehicle routing problem with three-dimensional loading constraints, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, A survey on matheuristics for routing problems, The split delivery capacitated team orienteering problem, A branch-and-price algorithm for solving the single-hub feeder network design problem

Cites Work

• Unnamed Item
• A reoptimization algorithm for the shortest path problem with time windows
• Vehicle routing with split deliveries
• An exact algorithm for IP column generation
• On the capacitated vehicle routing problem
• 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
• Split delivery routing
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Decomposition Principle for Linear Programs
• The Split Delivery Vehicle Routing Problem: A Survey
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Savings by Split Delivery Routing
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A column generation approach for the split delivery vehicle routing problem