Worst-case demand distributions in vehicle routing

DOI10.1016/J.EJOR.2016.03.047MaRDI QIDQ1752215zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A Vehicle Routing Problem with Stochastic Demand
• The distributionally robust chance-constrained vehicle routing problem
• The robust capacitated vehicle routing problem under demand uncertainty
• The vehicle routing problem with demand range
• The robust vehicle routing problem with time windows: solution by branch and price and cut

Cites work

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

Cited in

(4)

• Continuous approximation models in freight distribution management
• Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands
• Wasserstein distance and the distributionally robust TSP
• The vehicle routing problem with demand range

Describes a project that uses

Uses Software

• Concorde

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

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