Worst-case demand distributions in vehicle routing
نویسندگان
چکیده
منابع مشابه
Worst-case demand distributions in vehicle routing
A recent focal point in research on the vehicle routing problem (VRP) is the issue of robustness in which customer demand is uncertain. In this paper, we conduct a theoretical analysis of the demand distributions whose induced workloads are as undesirable as possible. We study two common variations of VRP in a continuous approximation setting: the first is the VRP with time windows, and the sec...
متن کاملWorst-Case Analysis for Split Delivery Vehicle Routing Problems
I the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem (SDVRP) the restriction that each customer is visited once is removed. We show that the cost savings that can be ...
متن کاملWorst-Case Coalitions in Routing Games
We investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the coalition can guarantee itself, under any (including worst) conditions. We then investigate fundamental solution concepts of the considered cooperative game, ...
متن کاملThe Vehicle Routing Problem with Demand Range
We propose and formulate the vehicle routing problem with demand range (VRPDR), a new variation on the traditional vehicle routing problem. In the VRPDR, the delivery quantity for each customer i is allowed to vary from its original size di by an amount αdi where 0 ≤ α < 1. In adding this limited flexibility to the problem, there is potential to generate significant savings in the total distanc...
متن کاملThe demand weighted vehicle routing problem
We consider the problem of constructing optimal bus routes for carrying students from residences to campus and then back home. In typical routing problems the objective is to minimize distance traveled subject to vehicle capacity constraints or meeting time window constraints. However, in this application the vehicles carry people and each person travels the entire length of the route. Therefor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.03.047