时变路网下多配送中心多车型联合配送研究

随着电子商务发展,越来越多的城市、企业采用多配送中心模式,优化补货车辆、配送站点车辆出行时刻及出行路线的优化变得越来越重要。目前考虑城市时变速度特征的多车型联合配送中,对配送车辆出行时刻和配送路径联合优化角度的研究成果较少。基于此,本文主要构建基于时变速度多配送中心多车型联合配送模型,并设计基于禁忌搜索求解算法,论文收集了北京市城市配送大数据,以北京市公铁联运城市配送为应用背景,对算法进行了验证,通过计算发现本算法可以有效优化多配送中心多车型联合配送运输成本和时间成本,算法能够应用于北京这种特大城市的公铁联运城市配送方案中。

Research on Multi-Depot Vehicle Routing Problem and Algorithm with Time-Varying Speeds Based on Joint Distribution

With the development of e-commerce and customer demand for distribution efficiency, the logistics distribution model is gradually developing into a small batch and multi-frequency frequency mode. Affected by factors such as loading rate and mileage, multi-distribution center mode is adopt by more and more companies, thus contributing the replenishment vehicles distributing between distribution centers. Therefore, it is becoming more and more important to optimize the travel time and travel route of replenishment vehicles and distribution stations. At present, there are less research on joint optimization model of vehicle schedule and route problem of multi-depot vehicle routing problem and algorithm with time-varying speeds based on joint distribution. Therefore, the model is built to solve this problem. Tabu algorithm is applied to find the optimal departure time of replenishment vehicle and customer vehicle and the vehicle routes. Finally, a simulation example about rail-road combined transportation is given to illustrate the optimization model and algorithm. The result shows that the model of multi-depot vehicle routing problem based on joint distribution can cut the transport cost and time cost.