Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

DOI10.1287/opre.1070.0449zbMath1167.90413DBLPjournals/ior/JepsenPSP08OpenAlexW2111658959WikidataQ58826423 ScholiaQ58826423MaRDI QIDQ3392186

Björn Petersen, Mads Kehlet Jepsen, Simon Spoorendonk, David Pisinger

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic network models in operations research (90B15) Inequalities for sums, series and integrals (26D15)

Related Items (only showing first 100 items - show all)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Two exact algorithms for the traveling umpire problem ⋮ The discrete time window assignment vehicle routing problem ⋮ Branch-and-cut-and-price for multi-agent path finding ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ Integer programming formulations for the elementary shortest path problem ⋮ Lifted and local reachability cuts for the vehicle routing problem with time windows ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Single liner shipping service design ⋮ A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ A new formulation and approach for the black and white traveling salesman problem ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ The pickup and delivery problem with time windows and handling operations ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ A branch-price-and-cut algorithm for the workover rig routing problem ⋮ A branch and price approach for deployment of multi-tier software services in clouds ⋮ Improved branch-cut-and-price for capacitated vehicle routing ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity ⋮ Modeling and solving profitable location and distribution problems ⋮ Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem ⋮ A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Branch‐price‐and‐cut for the truck–drone routing problem with time windows ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ Air cargo scheduling: integrated models and solution procedures ⋮ A tutorial on column generation and branch-and-price for vehicle routing problems ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ Combined location and routing problems for drug distribution ⋮ Limited memory rank-1 cuts for vehicle routing problems ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows ⋮ Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster ⋮ Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A column generation algorithm for the vehicle routing problem with soft time windows ⋮ Minimum makespan vehicle routing problem with compatibility constraints ⋮ A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows ⋮ Optimal routing with failure-independent path protection ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Solving bin packing problems using VRPSolver models ⋮ Bidirectional labeling for solving vehicle routing and truck driver scheduling problems ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities ⋮ Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ Cutting planes for branch-and-price algorithms ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem ⋮ A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Fleet routing position-based model for inventory pickup under production shutdown ⋮ A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows

Uses Software

• CVRPSP

This page was built for publication: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows