The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
From MaRDI portal
Publication:6161273
DOI10.1016/j.orl.2022.11.005zbMath1525.90061OpenAlexW4309772413MaRDI QIDQ6161273
Joshua Gunter, Ricardo Fukasawa
Publication date: 27 June 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.11.005
Integer programming (90C10) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- Unnamed Item
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Stochastic vehicle routing: A comprehensive approach
- Models and exact solutions for a class of stochastic location-routing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- New optimality cuts for a single-vehicle stochastic routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
- A generic exact solver for vehicle routing and related problems
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands