基于混合遗传算法的可变尺寸货物装箱问题研究  

Hybrid Genetic Algorithm for Solving 3D Bin Packing Problem with Variable Size

作　　者：徐江 王航 周艳杰 冯雪皓 XU Jiang;WANG Hang;ZHOU Yanjie;FENG Xuehao(School of Management,Zhengzhou University,Zhengzhou 450001,China;Ocean College,Zhejiang University,Zhejiang Zhoushan 316021,China)

机构地区：[1]郑州大学管理学院,郑州450001 [2]浙江大学海洋学院,浙江舟山316021

出　　处：《包装工程》2024年第13期259-267,共9页Packaging Engineering

基　　金：国家自然科学基金(72201252,72171211)。

摘　　要：目的针对冷链运输中的生鲜打包及装载优化问题,提出一种允许货物以体积恒定为前提进行尺寸变化的包装装载方案,以最大化集装箱的空间利用率。方法基于上述问题,构建非线性混合整数规划模型,为了方便CPLEX或LINGO等求解器对该非线性混合整数规划模型进行求解,采用一种分段线性化方法,将该非线性模型进行线性化处理。由于所研究问题具有NP-hard属性,无论是CPLEX还是LINGO都无法有效求解大规模算例,因此设计一种有效结合遗传算法与深度、底部、左部方向优先装载(Deepest bottom left with fill,DBLF)的算法。结果大小规模算例实验验证结果表明,混合遗传算法能够在合理时间内获得最优解或近似最优解。结论所提出的可变尺寸包装方案有效提高了装载率,有益于客户和物流公司。The work aims to propose a package loading scheme that allows the cargo to change size on the premise of constant volume,to solve the problem of fresh packaging and loading optimization in cold chain transportation,and maximize the space utilization rate of containers.A nonlinear mixed integer programming model was proposed to formulate the varietal package packing problem.To solve the nonlinear mixed integer programming model by solvers including CPLEX or Lingo,the internalization method was adopted to linearize the nonlinear integer programming model.Due to the NP-hardness of the studied problem,CPLEX or LINGO could not solve large-scale problems.An algorithm which effectively combined genetic algorithm and deepest bottom left with fill(DBLF)was designed.The experimental results of large and small scale examples showed that the hybrid genetic algorithm could obtain the optimal solution or approximate optimal solution in a reasonable time,which verified the performance of the algorithm.The proposed variable-size package scheme effectively improves the loading rate and could benefit both customers and the express delivery company.

关 键 词：遗传算法 三维装箱问题 非线性混合整数规划模型 

分 类 号：TB489[一般工业技术—包装工程]