提高圆形货物装箱率新的简便解法研究  

A Study on a New Simple Solution to Improving the Packing Rate of Round Cargo

作　　者：贾春玉 刘海金[1] 周艳[1] JIA Chun-yu;LIU Hai-jin;ZHOU Yan(Guangdong Peizheng College,Guangzhou,Guangdong,510830,China)

机构地区：[1]广东培正学院管理学院,广东广州510830

出　　处：《武汉商学院学报》2022年第6期53-58,共6页Journal of Wuhan Business University

基　　金：广东培正学院项目《圆柱型货物三维装箱优化方法研究》(项目编号:22PZXJYB007)。

摘　　要：圆形货物装箱问题是复杂NP难问题,当问题规模较大时很难在有限空间内获得最优解。为了解决这一问题,人们提出许多近似最优解法。这些方法相对复杂、求解时间长、当问题规模较小时,优化程度有时不够理想。为了简化解法、进一步提高优化程度,提出新的简便解法。新的解法是紧凑压缝摆放和松散摆放相结合、纵向和横向松散摆放相结合,运用规划求解可有效解决单一圆形货物装箱问题,进一步提高优化程度,经过实证比较新的规划解法好于递归等解法,新解法相对简单、易于掌握、优化程度高。Packing of round cargo is a complex NP-hard problem, and it is difficult to obtain the optimal solution in a finite space when the cargo is relatively big.In order to solve this problem, many approximate optimal solutions have been proposed.These methods are relatively complex, and the solution is time-consuming, and when the cargo is relatively small, the optimization is sometimes not satisfactory.In order to simplify the solution and further improve the optimization, a new simple solution is desirable.The new solution is the combination of compact stacking and loose stacking, as well as of longitudinal and horizontal loose stacking.The programming solution can effectively solve the problem of packing single round cargo and further improve the optimization.Through empirical comparison, the new programming solution is proved better than the recursive solution;it is relatively simple and easier to master with higher optimization.

关 键 词：圆形货物 装箱问题 新的简便解法 递归解法 优化程度 

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