Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence
Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence
复制标题
DOI：
10.1016/j.ejor.2011.03.011
复制
发表时间：
2011-08
期刊：
影响因子：
--
通讯作者：
I. Minis;A. Tatarakis
中科院分区：
文献类型：
--
作者：
I. Minis;A. Tatarakis
本文研究了具有随机需求的单车运送产品和提货的路径问题。车辆遵循预定义的客户顺序，并允许根据需要返回车辆段进行装卸。提出了一种确定最小期望路由代价的动态规划算法。此外，通过提出适当的定理，推导出了车辆驾驶员应遵循的最优路径策略。通过求解大型问题集，研究了该算法的效率。
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.