Worst-case demand distributions in vehicle routing

DOI10.1016/j.ejor.2016.03.047zbMath1394.90080OpenAlexW2336422596MaRDI QIDQ1752215

John Gunnar Carlsson, Mehdi Behroozi

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.047

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (2)

Continuous approximation models in freight distribution management ⋮ Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive evolutionary approach for real-time vehicle routing and dispatching
• The robust vehicle routing problem with time windows
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Quantizers ad the worst case Euclidean traveling salesman problem
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• Limit theorems and rates of convergence for Euclidean functionals
• A continuous approach to the design of physical distribution systems
• Data-driven robust optimization
• On distributionally robust chance-constrained linear programs
• Planning and approximation models for delivery route based services with price-sensitive demands
• Stirling's Approximation for n!: The Ultimate Short Proof?
• Robust Convex Optimization
• The Truck Dispatching Problem
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Robust Partitioning for Stochastic Multivehicle Routing
• The shortest path and the shortest road through n points
• Distribution Strategies that Minimize Transportation and Inventory Costs
• Bounds and Heuristics for Capacitated Routing Problems
• Modeling Distribution Problems with Time Windows: Part I
• Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
• Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Power Diagrams: Properties, Algorithms and Applications
• How Long Can a Euclidean Traveling Salesman Tour Be?
• Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Convex Programming and Duality in Normed Space

This page was built for publication: Worst-case demand distributions in vehicle routing