VMI模式下的库存路径问题及其优化算法综述  

Literature Review of Inventory Routing Problem and Optimization Algorithm in VMI Mode

作　　者：樊立峰 FAN Lifeng(China Railway Design Corporation,Tianjin 300308,China)

机构地区：[1]中国铁路设计集团有限公司,天津300308

出　　处：《物流技术》2023年第1期10-14,38,共6页Logistics Technology

摘　　要：库存路径问题(IRP)是车辆路径问题和库存管理问题的结合,对供应商优化库存管理、车辆路线和交货计划,提供集成的物流解决方案具有重要意义。首先对VMI模式下库存路径问题的背景及分类进行综合分析,对引入该问题基础版本的精确算法及启发式算法的相关研究进行系统归纳梳理。针对基础版本外的随机库存路径问题,从有限计划范围和无限计划范围对相关算法的研究文献进行分类总结。最后结合问题发展趋势,对动态随机库存路径问题的研究成果进行归纳,指出IRP问题及算法将向着更加复杂的扩展层面发展。Firstly, this paper comprehensively analyzed the background and classification of the inventory routing problem in VMI mode, and systematically summarized the relevant researches on the exact algorithm and heuristic algorithm introduced into the basic version of the problem. Then, for the stochastic inventory routing problem not covered by the basic version, we classified and summarized the literature of related algorithms into the finite plan scope and the infinite plan scope. Finally, in light of the development trend of the research field, we summarized the research results of the dynamic stochastic inventory routing problem, and pointed out that IRP and its algorithms would develop towards more complex and extended levels.

关 键 词：VMI模式 库存路径问题 算法 文献综述 

分 类 号：F274[经济管理—企业管理] F253[经济管理—国民经济]