Technical Note—Approximation Algorithms for VRP with Stochastic Demands

DOI10.1287/opre.1110.0967zbMath1247.90050OpenAlexW2023848998MaRDI QIDQ2892219

Viswanath Nagarajan, R. Ravi, Anupam Gupta

Publication date: 18 June 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1110.0967

zbMATH Keywords

vehicle routingsuboptimal algorithmsstochastic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ Approximation algorithms for the a priori traveling repairman ⋮ Improved approximation algorithms for cumulative VRP with stochastic demands ⋮ On risk-averse maximum weighted subgraph problems ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands ⋮ A decision framework for automatic guided vehicle routing problem with traffic congestions ⋮ Capacitated Vehicle Routing with Non-uniform Speeds ⋮ Approximation Algorithms for Cumulative VRP with Stochastic Demands ⋮ Capacitated Vehicle Routing with Nonuniform Speeds ⋮ A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands

This page was built for publication: Technical Note—Approximation Algorithms for VRP with Stochastic Demands