کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480755 | 1446098 | 2011 | 15 صفحه PDF | دانلود رایگان |
In this paper we study the routing of a single vehicle that delivers products and picks up items with stochastic demand. The vehicle follows a predefined customer sequence and is allowed to return to the depot for loading/unloading as needed. A suitable dynamic programming algorithm is proposed to determine the minimum expected routing cost. Furthermore, the optimal routing policy to be followed by the vehicle’s driver is derived by proposing an appropriate theorem. The efficiency of the algorithm is studied by solving large problem sets.
► We study routing of a vehicle that delivers/picks up products with stochastic demand.
► We develop and analyze an optimal dynamic programming algorithm.
► We identify the optimal routing policy by proposing and proving an appropriate theorem.
Journal: European Journal of Operational Research - Volume 213, Issue 1, 16 August 2011, Pages 37–51