A unifying framework for the capacitated vehicle routing problem under risk and ambiguity

DOI10.1287/OPRE.2021.0669MaRDI QIDQ6579639FDOQ6579639

Authors Shubhechyya Ghosal, Chin Pang Ho, Wolfram Wiesemann

Publication date 25 July 2024

Published in Operations Research (Search for Journal in Brave)

zbMATH Keywords

stochastic programmingtransportationbranch-and-cutcapacitated vehicle routing problemdistributionally robust optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Recommendations

• The distributionally robust chance-constrained vehicle routing problem
• The robust capacitated vehicle routing problem under demand uncertainty
• The capacitated vehicle routing problem with evidential demands
• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• Approximating the chance-constrained capacitated vehicle routing problem with robust optimization

This page was built for publication: A unifying framework for the capacitated vehicle routing problem under risk and ambiguity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579639)