STOCHASTIC DEMAND IN VEHICLE ROUTING PROBLEM WITH COMPARTMEN
نویسندگان
چکیده
منابع مشابه
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 Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be duration-feasible for all demand reali...
متن کاملThe Stochastic Vehicle Routing Problem for Minimum Unmet Demand
In this paper, we are interested in routing vehicles to minimize unmet demand with uncertain demand and travel time parameters. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such a...
متن کاملThe Minimum Unmet Demand Stochastic Vehicle Routing Problem
In this paper, we are interested in routing vehicles to minimize unmet demand under uncertainty. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such as natural disasters or terroris...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Angkasa: Jurnal Ilmiah Bidang Teknologi
سال: 2019
ISSN: 2581-1355,2085-9503
DOI: 10.28989/angkasa.v11i2.443