Improved branch-cut-and-price for capacitated vehicle routing
From MaRDI portal
Publication:2398107
DOI10.1007/s12532-016-0108-8zbMath1368.90111OpenAlexW2518529723MaRDI QIDQ2398107
Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa, Diego Pecin
Publication date: 15 August 2017
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-016-0108-8
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)
Related Items (62)
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ 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 ⋮ A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ The joint network vehicle routing game with optional customers ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Routing optimization with time windows under uncertainty ⋮ Adjusting the order crossover operator for capacitated vehicle routing problems ⋮ Approximating the chance-constrained capacitated vehicle routing problem with robust optimization ⋮ Column elimination for capacitated vehicle routing problems ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ Estimating the marginal cost to deliver to individual customers ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows ⋮ Preprocessing to reduce vehicle capacity for routing problems ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ 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 ⋮ Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ A Joint Vehicle Routing and Speed Optimization Problem ⋮ Branch-and-price for a multi-attribute technician routing and scheduling problem ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Efficiently solving very large-scale routing problems ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Conference scheduling: a clustering-based approach ⋮ The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time ⋮ 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 ⋮ Preprocessing and cutting planes with conflict graphs ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Solving bin packing problems using VRPSolver models ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ Two-echelon vehicle routing problems: a literature review ⋮ 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 ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources ⋮ A unified exact approach for clustered and generalized vehicle routing problems ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering ⋮ Projection heuristics for binary branchings between sum and product
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integer programming techniques for the nurse rostering problem
- Efficient elementary and restricted non-elementary route pricing
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Conflict analysis in mixed integer programming
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- The Truck Dispatching Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
This page was built for publication: Improved branch-cut-and-price for capacitated vehicle routing
