Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows

DOI10.1287/OPRE.1090.0713MaRDI QIDQ3100458zbMATH OpenOpenAlexFDO

Authors Guy Desaulniers

Publication date 24 November 2011

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1090.0713

zbMATH Keywords

integer programming: branch-and-price-and-cut algorithmtransportation: vehicle routing

Mathematics Subject Classification ID

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

Recommendations

• 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
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem

Cited in

(65)

• The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
• An exact solution approach for the inventory routing problem with time windows
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• A branch-and-cut embedded matheuristic for the inventory routing problem
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
• The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
• Two exact algorithms for the traveling umpire problem
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
• 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 multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
• A note on branch-and-cut-and-price
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
• The surgical patient routing problem: a central planner approach
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• The split delivery capacitated team orienteering problem
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• A multi‐vehicle covering tour problem with speed optimization
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• Regenerator location problem in flexible optical networks
• Exact algorithms for electric vehicle-routing problems with time windows
• An exact solution method for home health care scheduling with synchronized services
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Combined maintenance and routing optimization for large-scale sewage cleaning
• The prisoner transportation problem
• The fixed-charge shortest-path problem
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• The inventory routing problem with demand moves
• A branch-and-price algorithm for the liner shipping network design problem
• Integer linear programming models for a cement delivery problem
• Integrated charge batching and casting width selection at Baosteel
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
• Particle swarm optimization for split delivery vehicle routing problem
• Vehicle routing problems with split deliveries
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Scheduling cleaning activities on trains by minimizing idle times
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
• New exact solution approaches for the split delivery vehicle routing problem
• Synchronized routing of active and passive means of transport
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• A column generation approach for the split delivery vehicle routing problem
• The nuclear medicine production and delivery problem
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
• Liner shipping network design with deadlines
• Column generation for vehicle routing problems with multiple synchronization constraints
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows
• A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
• Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
• A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement
• Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

This page was built for publication: Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows

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