Approximating the chance-constrained capacitated vehicle routing problem with robust optimization

DOI10.1007/s10288-022-00523-3zbMath1522.90061OpenAlexW4295980570MaRDI QIDQ6054019

Karina Thiebaut, Artur Alves Pessoa

Publication date: 24 October 2023

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-022-00523-3

zbMATH Keywords

vehicle routingrobust optimizationcapacity cutschance-constraintsuncertain demands

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Robustness in mathematical programming (90C17)

Cites Work

• The vehicle routing problem. Latest advances and new challenges.
• Exact algorithms for routing problems under vehicle capacity constraints
• Models and exact solutions for a class of stochastic location-routing problems
• New benchmark instances for the capacitated vehicle routing problem
• Exact algorithms for the chance-constrained vehicle routing problem
• A generic exact solver for vehicle routing and related problems
• Improved branch-cut-and-price for capacitated vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Vehicle Routing
• Lectures on Stochastic Programming
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
• The Distributionally Robust Chance-Constrained Vehicle Routing Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the chance-constrained capacitated vehicle routing problem with robust optimization