The capacitated vehicle routing problem with stochastic demands and time windows
The capacitated vehicle routing problem with stochastic demands and time windows
复制标题
DOI：
10.1016/j.cor.2011.02.007
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
Hongtao Lei;G. Laporte;Bo Guo
中科院分区：
文献类型：
--
作者：
Hongtao Lei;G. Laporte;Bo Guo
带时间窗的随机需求能力约束车辆路径问题是随机需求能力约束车辆路径问题的推广，其中需求是随机的，每个顶点上都有一个时间窗。当实现的需求超过车辆容量时发生的顶点故障可能会触发相同路线中剩余顶点上的故障的连锁反应，这是时间窗口的结果。本文将该问题建模为一个带补偿的随机规划问题，并提出了一种自适应大邻域搜索算法。实验中使用了改进的所罗门基准测试实例。计算结果清楚地表明，所提出的启发式的优越性，一种替代的解决方案的方法。
The capacitated vehicle routing problem with stochastic demands and time windows is an extension of the capacitated vehicle routing problem with stochastic demands, in which demands are stochastic and a time window is imposed on each vertex. A vertex failure occurring when the realized demand exceeds the vehicle capacity may trigger a chain reaction of failures on the remaining vertices in the same route, as a result of time windows. This paper models this problem as a stochastic program with recourse, and proposes an adaptive large neighborhood search heuristic for its solution. Modified Solomon benchmark instances are used in the experiments. Computational results clearly show the superiority of the proposed heuristic over an alternative solution approach.