Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand

DOI10.1007/978-3-642-23283-1_6zbMath1351.90022MaRDI QIDQ3105744

Ei Ando, Qiaosheng Shi, Tsunehiko Kameda, Binay K. Bhattacharya, Yuzhuang Hu

Publication date: 6 January 2012

Published in: Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23283-1_6

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

68W25: Approximation algorithms

Related Items

A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands

Cites Work

• Unnamed Item
• Unnamed Item
• The vehicle routing problem. Latest advances and new challenges.
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• A survey on stochastic location and routing problems
• Algorithms for Capacitated Vehicle Routing
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Bounds and Heuristics for Capacitated Routing Problems
• Capacitated Vehicle Routing on Trees
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Algorithms and Data Structures
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• A Vehicle Routing Problem with Stochastic Demand