两种圆柱形货物装箱问题研究  

Study on Packing Problem of Two Kinds of Cylindrical Goods

作　　者：贾春玉 郭美芳 JIA Chunyu;GUO Meifang(Guangdong Peizheng College,Guangzhou 510830,China)

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

出　　处：《通化师范学院学报》2024年第6期25-32,共8页Journal of Tonghua Normal University

摘　　要：两种圆柱形货物装箱问题是复杂的NP难问题,现有解法对问题的描述多数为奇数层和偶数层,以及每层摆放个数,需要向上或向下取整确定相关数值,很难构建数学模型进行精确求解和提高优化程度.现有解法多数是启发式、递归式智能搜索法等.这些方法虽然能解决许多装箱或下料问题,但相对复杂、繁琐,不易掌握和实际运用.为了克服这些问题,该文提出一种新的简便解法,该解法一方面对问题进行重新描述,分为对齐层、压缝单数层和双数层,便于构建数学模型.另一方面根据剩余尺寸上限,缩小变量取值范围,使问题规模急剧缩小,可有效运用线性规划求解这类问题.新解法相对简单,易于掌握,优化程度高.The packing problem of two kinds of cylindrical goods is a complex NP hard problem.Most of the existing solutions describe the problem as odd and even layers,and the number of each layer.It needs to round up or down to determine the relevant values,so it is difficult to build a mathematical model for accurate solution and improve the degree of optimization.Most of the existing solutions are heuristic and recursive intelligent search methods.Although these methods can solve many packing or cutting problems,they are relatively complex,cumbersome,difficult to master and be applied.In order to overcome these problems,a simple solution is put forward.On the one hand,the new solution redescribes the problem,which is divided into alignment layer,odd number layer and even number layer,and it is convenient to build the mathematical model.On the other hand,according to the upper limit of the remaining size,the range of variable values is reduced,so that the scale of the problem is sharply reduced,which can be effectively solved by programming.The new method is relatively simple and easy to master,and has a high degree of optimization.

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

分 类 号：O22[理学—运筹学与控制论] F252.13[理学—数学]