考虑库门分配及时间依赖的生鲜品越库配送车辆路径优化

Time-dependent vehicle routing problem for fresh products with cross-docking and door assignment

中文关键词  多越库中心车辆路径问题  自适应大邻域搜索算法  库门分配  时间依赖型  生鲜品

英文关键词  vehicle routing problem with multiple cross-docks  adaptive large neighborhood search algorithm  door assignment  time-dependent  fresh products

中文摘要

      为减少多品种生鲜物流成本, 本文研究了多越库中心多库门的车辆路径问题, 并设计算法优化车辆路径. 综合考虑多越库中心联合配送、库内操作、客户时间窗、生鲜品货损、车辆行驶速度时变、车辆能耗等因素, 以车辆 派遣成本、货损成本、集货油耗成本、配送电耗成本、时间窗惩罚成本和越库运输成本之和最小为目标建立优化模 型. 根据问题特征, 设计自适应大邻域搜索算法对其进行求解, 该算法根据算子的历史表现和使用次数选择下一次 迭代使用的算子, 对原解进行移除插入操作. 通过求解多组规模不同的算例以验证模型的正确性和算法的有效性. 在数值实验部分分析了不同规模下的配送成本, 同时对车辆行驶速度和车辆不同返回策略进行灵敏度分析, 说明所 提问题考虑多中心联合配送以及速度时变的必要性. 研究成果不仅丰富了生鲜品越库配送的场景, 拓展了越库配 送车辆路径问题的研究, 也为物流企业制定配送方案提供了理论依据.

英文摘要

      The vehicle routing problem with multi-door cross-docking is studied to reduce the logistics cost of multiple varieties of fresh food and an algorithm is designed to optimize the vehicle transportation path. Considering joint distribution of multiple cross-docks, cross-docking operation, time window, fresh products damage, time-varying vehicle speed, energy consumption of trucks, establishing an optimization model which is aimed at minimizing the sum of vehicle dispatch cost, products damage cost, fuel cost, electricity cost, penalty cost and cross-docking operation cost. According to the characteristics of the problem, an adaptive large neighborhood search is designed to solve it. The algorithm selects operators based on performance and usage frequency to destroy and repair the feasible solutions. Solving multiple cases with different scales to verify the correctness of the model and the effectiveness of the algorithm. In the numerical experiments, we analyzed the total cost with different scales. In addition, the sensitivity analysis of vehicle speed and return back mode is performed to illustrate the necessity of the proposed problem to consider time-varying speed and joint distribution of multiple cross-docks. The research results not only enrich the scene of fresh products distribution with cross-docking, expand the research on vehicle routing problem with cross-docking (VRPCD), but also provide a basis for logistics enterprises to formulate delivery plans.