The Distributionally Robust Chance-Constrained Vehicle Routing Problem
From MaRDI portal
Publication:5130504
DOI10.1287/opre.2019.1924zbMath1445.90009OpenAlexW3020137299MaRDI QIDQ5130504
Wolfram Wiesemann, Shubhechyya Ghosal
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/72275
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36) Robustness in mathematical programming (90C17)
Related Items (16)
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Tight tail probability bounds for distribution-free decision making ⋮ Approximating the chance-constrained capacitated vehicle routing problem with robust optimization ⋮ Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut ⋮ Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Distributionally robust equilibrious hybrid vehicle routing problem under twofold uncertainty ⋮ Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints ⋮ Wasserstein distributionally robust chance-constrained program with moment information ⋮ A distributionally robust chance-constrained model for humanitarian relief network design ⋮ Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems ⋮ Distributionally robust optimization. A review on theory and applications ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut ⋮ Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics ⋮ Learning to Approximate Industrial Problems by Operations Research Classic Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A comment on ``Computational complexity of stochastic programming problems
- Tractable stochastic analysis in high dimensions via robust optimization
- The vehicle routing problem. Latest advances and new challenges.
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing
- The concept of comonotonicity in actuarial science and finance: theory.
- The mean and median absolute deviations
- Separating capacity constraints in the CVRP using tabu search
- Data-driven robust optimization
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Exact algorithms for the chance-constrained vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- On safe tractable approximations of chance constraints
- Distributionally robust joint chance constraints with second-order moment information
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- Adaptive restart for accelerated gradient schemes
- Improved branch-cut-and-price for capacitated vehicle routing
- Routing optimization with time windows under uncertainty
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Computational complexity of stochastic programming problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Lectures on Modern Convex Optimization
- The Truck Dispatching Problem
- Stochastic Vehicle Routing Problem with Restocking
- A Robust Optimization Model for Managing Elective Admission in a Public Hospital
- Routing Optimization Under Uncertainty
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Smoothing and First Order Methods: A Unified Framework
- Vehicle Routing
- Distributionally Robust Convex Optimization
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Robust Network Design with Uncertain Outsourcing Cost
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- The Price of Robustness
- Optimal Routing under Capacity and Distance Restrictions
- The Vehicle Routing Problem with Stochastic Travel Times
- Vehicle routing with stochastic demands and restricted failures
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Robust Adaptive Routing Under Uncertainty
- Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information
- Bootstrap Methods
- Robust Portfolio Selection Problems
This page was built for publication: The Distributionally Robust Chance-Constrained Vehicle Routing Problem