铁道科学与工程学报2018，Vol.15Issue(5)：1323-1332,10.
随机需求订单可拆分的多目标车辆路径问题
Multi-objective vehicle routing problem with stochastic demand and split deliveries
摘要
Abstract
Considering the stochastic demand, the workload and income of the driver may be affected by the length of the line, this paper studies the multi-objective vehicle routing problem based on the demand stochastic, and adds the line length balance as the goal. This model is more practical than the original single-objective model. In addition, demands can be split to increase the vehicle loading rate, reduce delivery costs. Based on the above considerations, this paper constructs a model of dual-objective vehicle routing considering the stochastic demand, and proposes a paired vehicle recourse policy. Aiming at solving the problem, an adaptive large neighborhood search algorithm is designed. The validity of the model and algorithm is verified by the Solomon standard example.关键词
随机需求/需求可拆分/大规模邻域自适应搜索算法/路径均衡Key words
stochastic demand/split deliveries/adaptive large neighborhood search/routing balance分类
管理科学引用本文复制引用
张得志,何亦扬,龚浩翔..随机需求订单可拆分的多目标车辆路径问题[J].铁道科学与工程学报,2018,15(5):1323-1332,10.基金项目
国家自然科学基金资助项目(71271220,71672193) （71271220,71672193）
