考虑温层和冷媒装载约束的冷链商品三维多箱型装箱问题研究  

Three-dimensional multiple bin-size bin packing problem with temperature layer and refrigerant loading constraints

作　　者：沈倪 夏佳楠 马弘 刘雨 SHEN Ni;XIA Jianan;MA Hong;LIU Yu(School of Management,Zhejiang University,Hangzhou 310058,China;School of Business,Hangzhou City University,Hangzhou 310015,China;Polytechnic Institute,Zhejiang University,Hangzhou 310015,China;Faculty of Business,The Hong Kong Polytechnic University,Hong Kong 999077,China)

机构地区：[1]浙江大学管理学院,杭州310058 [2]浙大城市学院商学院,杭州310015 [3]浙江大学工程师学院,杭州310015 [4]香港理工大学工商管理学院,中国香港999077

出　　处：《系统工程理论与实践》2025年第2期685-701,共17页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(71821002,71201141)。

摘　　要：在冷链物流企业装箱作业中,不仅需要满足传统装箱问题中所涉及的空间约束,同时也需要满足不同商品存放时的温度要求.在实际作业中,不同的商品具有不同的装箱温层区间,温层区间不相交的商品不能被装入同一个箱子.为维持运输中温度的稳定,需在箱内装入一定数量的冷媒,而这又会影响到箱内可装载的空间,对成本产生不利影响.为解决这一挑战,本文研究带有温层和冷媒装载约束的冷链商品三维多箱型装箱问题,综合考虑了冷媒、箱子、运输三项成本并给出其数学规划模型,同时设计了三种用于求解该问题的启发式算法.本文基于一大型电商物流企业的真实订单数据,改造生成了不同规模的测试算例以检验各算法的表现.数值实验结果表明,所提出的三种算法都能在合理的时间内给出该问题的较优解.通过与各算例最优解的下界比较,发现基于物品分组的启发式算法求得的平均成本距下界最近,但求解速度较慢.求解速度最快的为结合模拟退火的基于极端点法的构造型启发式算法,但其在大规模测试算例上的表现要差于其他两种算法.通过进一步对比分析三种算法的适用场景,能够为企业提供管理见解与启示,有望改善冷链物流企业的实际装箱操作流程.In the bin-packing operations in cold chain logistics companie,it is essential to meet not only the spatial constraints involved in traditional packaging problems but also the temperature requirements for storing different goods.Different goods have distinct temperature layer for packaging,and goods with non-overlapping temperature layers cannot be packed into the same boxes(bins).In this work,we study the 3D multiple bin-size bin packing problem with temperature layer and refrigerant loading constraints(3DMBSBPP-TLRL)that focuses on packing a list of perishable goods into insulated boxes(bins)of different types that are loaded with refrigerant packs in different quantities.Our objective is to minimize the total material and shipping costs.Since the insulated bins require special packing materials and refrigerant that are expensive,inefficient planning during the setup or packing,however small,can adversely affect costs.We first develop a set of geometric constraints as well as two temperature-related constraints for this problem.The temperature layers and refrigerant loads are considered.Then,we propose a mathematical programming model which in essence is a nonlinear programming model.We find that it is infeasible to solve this model directly.Next,we develop three different heuristic algorithms.Two of them are constructive heuristics based on extreme point and empty space generation.The third one is a two-stage heuristic algorithm based on item grouping.To test the proposed three algorithms,we conduct computation experiments based on real transaction data from a cold chain logistics company.The effectiveness of the algorithm in terms of run time and solution quality is verified compared with the solutions obtained from the relaxed mathematical programming model.Numerical experimental results show that while all three proposed three algorithms are able to provide reasonably good solutions to 3DMBSBPP-TLRL within a limited time,the two-stage heuristic algorithm based on items grouping performs best,achieving the l

关 键 词：三维多箱型装箱问题 冷链物流 温度敏感商品 构造型启发式算法 

分 类 号：F224.3[经济管理—国民经济] U169.42[交通运输工程]