The vehicle routing problem with hard time windows and stochastic service times
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملThe Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times
In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW the service times are random variables. In particular, given a set of vehicle routes, some of the actual service times might not lead to a feasible solution, given the customer time windows. We consider a chance-constrained program to model t...
متن کاملModeling and Solving the Vehicle Routing Problem with Stochastic Travel Times and Hard Time Windows
In practically all real-world planning and scheduling problems one is faced with uncertainty. Usually this uncertainty is abstracted away during the modeling process, such that standard combinatorial optimization algorithms can be used to solve the problem. This abstraction step is necessary, because these algorithms generally cannot deal with uncertainty. In this thesis we study the Vehicle Ro...
متن کاملVehicle routing problem with hard time windows and stochastic service time
In this paper we consider the Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times (VRPHTWSST). We can describe the problem as follows. Consider a directed graph G = (V,A) where V = {0, 1, . . . , n} is the node set, and A = {(i, j) | i, j ∈ N} is the arc set. Node 0 represents a depot where a fleet of homogeneous vehicles is initially located and Vc = {1, . . . , n} is t...
متن کاملA priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
The vehicle routing problem with hard time windows and stochastic service times (VRPTWST) introduced by Errico et al. (2013) in the form of a chance-constrained model, mainly differs from other vehicle routing problems with stochastic service or travel times considered in literature by the presence of hard time windows. This makes the problem extremely challenging. In this paper, we model the V...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Transportation and Logistics
سال: 2018
ISSN: 2192-4376
DOI: 10.1007/s13676-016-0101-4