需求点随机的分批配送VRP模型与算法研究

发布时间：2018-04-20 20:18

本文选题：需求点随机 + 分批配送　；参考：《控制与决策》2017年02期

【摘要】：针对城市配送中需求点不确定的现象,在分批配送车辆路径问题中引入随机需求点进行研究.建立带修正的随机规划模型,采用先验优化策略,根据分批配送的特点,在自适应大邻域搜索算法中引入改进的分割插入算子进行求解.在调整的Solomon算例上进行的测试表明,允许分批配送在大部分算例中的费用低于不允许分批配送的情形.通过分析计算过程中各个算子权重变化,确定性最差删除算子和随机删除算子在求解此类问题时表现较好;贪婪插入算子、后悔插入算子表现较好;而分割插入算子虽然权重较低,但能对解产生质的影响.
[Abstract]:In order to solve the problem of uncertain demand points in urban distribution, random demand points are introduced into the routing problem of batch distribution vehicles. A modified stochastic programming model is established and a priori optimization strategy is adopted. According to the characteristics of batch distribution, an improved partition insertion operator is introduced into the adaptive large neighborhood search algorithm to solve the problem. The test on the adjusted Solomon example shows that the cost of allowing batch distribution in most cases is lower than that of non-batch distribution. By analyzing the weight changes of each operator in the calculation process, the deterministic worst deletion operator and random deletion operator perform well in solving this kind of problem, greedy insertion operator and regret insertion operator perform well. Although the weight of segment insertion operator is low, it can influence the solution qualitatively.
【作者单位】：西南交通大学交通运输与物流学院;
【分类号】：TP301.6

【相似文献】