面向小容销比客户的库存路径问题模型与算法  

Model and algorithm of the inventory routing problem for customers with small capacity sales ratio

作　　者：刘志硕[1] 左兴权[2] 吴建军[3] LIU Zhishuo;ZUO Xingquan;WU Jianjun(School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China;School of Computer Science,Beijing University of Posts and Telecommunications,Beijing 100876,China;School of Systems Science,Beijing Jiaotong University,Beijing 100044,China)

机构地区：[1]北京交通大学交通运输学院,北京100044 [2]北京邮电大学计算机学院,北京100876 [3]北京交通大学系统科学学院,北京100044

出　　处：《系统工程理论与实践》2024年第6期2018-2032,共15页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(61873040,72361137003)。

摘　　要：针对推式配送模式和小容销比客户,将多次配送决策与车辆调度决策进行集成,提出了小容销比客户库存路径问题(inventory routing problem for customers with small capacity sales ratio, IRPSC),并分析了该问题的复杂性.在此基础上,针对加油站配送需求,提出了带隔舱、多行程的IRPSC (IRPSC-MM).以运输成本、卸油成本、缺货成本之和最小为目标建立了数学规划模型.设计了融合模拟退火的混合变邻域搜索算法(HVNS),并针对问题特点设计了五个新的邻域结构.采用HVNS求解不同规模算例以及实例.结果表明,与CPLEX和其它算法相比, HVNS能够高效地求解IRPSC-MM;从解的质量和运算时间来看,HVNS能够有效解决实际问题.This paper integrated multiple delivery decisions with vehicle scheduling decisions under the push delivery mode and proposed the inventory routing problem for customers with small capacity sales ratio(IRPSC).The complexity of IRPSC was analyzed.Then,the IRPSC with multiple compartments and multiple trips(IRPSC-MM)for gasoline delivery was proposed.A mathematical programming model was developed for IRPSC-MM to minimize the total cost of transportation,unloading,and stockout costs.A hybrid variable neighborhood search(HVNS)heuristic was developed to solve the problem and five neighborhood structures were new and problem-specific.HVNS was used to solve different scale instances and real-world instances.Numerical results show that:HVNS has superior performance in solving IRPSC-MM in comparison with CPLEX and other heuristics;it can effectively solve real-world problems in terms of solution quality and runtime.

关 键 词：推式配送 库存路径问题 容销比 变邻域搜索 加油站配送 

分 类 号：U116.2[交通运输工程] TP301.6[自动化与计算机技术—计算机系统结构]