Exact algorithms for the chance-constrained vehicle routing problem

From MaRDI portal
Publication:1800993

DOI10.1007/s10107-017-1151-6zbMath1406.90079OpenAlexW2611423960MaRDI QIDQ1800993

Thai Dinh, Ricardo Fukasawa, James R. Luedtke

Publication date: 26 October 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1151-6




Related Items

On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependencyParallel Machine Scheduling Under Uncertainty: Models and Exact AlgorithmsOptimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demandsApproximating the chance-constrained capacitated vehicle routing problem with robust optimizationRecent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cutStochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraintsChance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustnessDistributionally robust equilibrious hybrid vehicle routing problem under twofold uncertaintyThe complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demandsAn integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demandsThe Distributionally Robust Chance-Constrained Vehicle Routing ProblemBranch and Price for Chance-Constrained Bin PackingDistributionally robust optimization. A review on theory and applicationsBranch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack UncertaintyRobust vehicle routing under uncertainty via branch-price-and-cut


Uses Software


Cites Work


This page was built for publication: Exact algorithms for the chance-constrained vehicle routing problem