基于供应商管理库存模式的配送路径优化问题  

Distribution Routing Optimization Problem Based on Vendor Managed Inventory Mode

作　　者：李珍萍[1] 焦鹏博 LI Zhen-ping;JIAO Peng-bo(School of Information, Beijing Wuzi University, Beijing 101149, China)

机构地区：[1]北京物资学院信息学院,北京101149

出　　处：《科学技术与工程》2021年第26期11362-11367,共6页Science Technology and Engineering

基　　金：国家自然科学基金(71771028);北京市自然科学基金(Z180005,9212004);北京市属高校高水平创新团队支持计划项目(IDHT20180510)。

摘　　要：基于供应商管理库存(vendor managed inventory,VMI)模式制定科学的产品配送决策,可以合理优化库存水平、有效提高物流运输效率。针对VMI模式下的配送路径优化问题开展研究,考虑客户的产品消耗率和服务时间窗等因素,以总配送成本最小为目标建立混合整数规划模型,并设计了贪婪算法。利用Gurobi求解器对小规模算例进行求解,分析了VMI模式的优越性,结果表明:基于VMI模式的配送路径规划方案可以有效减少库存水平,降低总配送成本;然后利用中等规模算例分析贪婪算法的求解效果,结果显示,对于40个点的中等规模算例,求解器在240 min内无法得到最优解,而贪婪算法可以在0.2 s之内得到近似最优解。Making scientific product distribution decisions based on the vendor managed inventory(VMI)mode can reasonably optimize inventory levels and effectively improve logistics and transportation efficiency.The vehicle routing problem based on VMI mode was investigated with considering factors such as the customer's product consumption rate and time windows.A mixed integer programming model was established to minimize the total distribution cost.A greedy algorithm was designed for solving the model.A small-scale instance is solved by Gurobi solver and analyzed to verify the advantages of the VMI mode.The results show that the inventory levels and total delivery cost can be effectively reduced by the optimal distribution routes based on the VMI mode.A medium-scale instance with 40 customers is used to analyze the effectiveness of the greedy algorithm,the optimal solution is not found after Gurobi solver running for 240 minutes,while the approximate optimal solution is obtained within 0.2 seconds using the greedy algorithm.

关 键 词：供应商管理库存(vendor managed inventory VMI) 时间窗 配送路径优化 混合整数规划 贪婪算法 

分 类 号：U116.2[交通运输工程] U116.5