Districting for routing with stochastic customers
Districting for routing with stochastic customers
复制标题
DOI：
10.1007/s13676-012-0005-x
复制
发表时间：
2012-04
影响因子：
2.4
通讯作者：
Hongtao Lei;G. Laporte;Bo Guo
中科院分区：
文献类型：
--
作者：
Hongtao Lei;G. Laporte;Bo Guo
介绍了随机顾客车辆路径与分配问题（VRDPSC）.这个问题被建模和解决为一个两阶段的随机规划，在此期间的分区决策在第一阶段和Beardwood-Halton-Hammersley公式是用来近似的期望路由成本的每个地区在第二阶段。区域紧凑度也被认为是目标函数的一部分。我们已经开发了一个大的邻域搜索启发式VRDPSC。启发式测试修改后的所罗门的情况下，修改后的Gehring和Homberger的情况下。大量的计算结果证实了所提出的启发式的有效性。
We introduce the vehicle routing and districting problem with stochastic customers (VRDPSC). This problem is modelled and solved as a two-stage stochastic program during which the districting decisions are made in the first stage and the Beardwood–Halton–Hammersley formula is used to approximate the expected routing cost of each district in the second stage. District compactness is also considered as part of the objective function. We have developed a large neighbourhood search heuristic for VRDPSC. The heuristic was tested on modified Solomon instances and on modified Gehring and Homberger instances. Extensive computational results confirm the effectiveness of the proposed heuristic.