Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:3100458
DOI10.1287/OPRE.1090.0713zbMath1233.90065OpenAlexW2078227935MaRDI QIDQ3100458
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (49)
A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times ⋮ Branch-and-cut algorithms for the split delivery vehicle routing problem ⋮ Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery ⋮ Two exact algorithms for the traveling umpire problem ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ Liner shipping network design with deadlines ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Integrated Charge Batching and Casting Width Selection at Baosteel ⋮ Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route ⋮ The prisoner transportation problem ⋮ Combined maintenance and routing optimization for large-scale sewage cleaning ⋮ An exact solution approach for the inventory routing problem with time windows ⋮ Integer linear programming models for a cement delivery problem ⋮ The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ The Maritime Pickup and Delivery Problem with Time Windows and Split Loads ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Scheduling cleaning activities on trains by minimizing idle times ⋮ Synchronized routing of active and passive means of transport ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ A branch-and-price algorithm for the liner shipping network design problem ⋮ The inventory routing problem with demand moves ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ A randomized granular tabu search heuristic for the split delivery vehicle routing problem ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ Particle Swarm Optimization for Split Delivery Vehicle Routing Problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ Column generation for vehicle routing problems with multiple synchronization constraints ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Vehicle routing problems with split deliveries ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ Branch and price for the vehicle routing problem with discrete Split deliveries and time windows ⋮ 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 ⋮ A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem ⋮ The split delivery capacitated team orienteering problem ⋮ The Fixed-Charge Shortest-Path Problem ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ The nuclear medicine production and delivery problem
This page was built for publication: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
