单一货物摆放无约束三维装箱简便快速优化装箱方法  

Simple and Rapid Optimization of Packing Method for Single Goods Unconstrained Three-dimensional Packing Problem

作　　者：蒲荣雪 吴铃[1] 李国柳 贾春玉[1] PU Rong-xue WU Ling LI Guo-liu JIA Chun-yu(School of Economics ＆ Management, Ningbo University, Ningbo 315211, China)

机构地区：[1]宁波工程学院经济与管理学院,宁波315211

出　　处：《技术与创新管理》2017年第2期132-135,共4页Technology and Innovation Management

摘　　要：装箱问题传统解法计算工作量大、不易掌握且装箱效率低,为了克服问题提出新的优化解法,该方法把装箱作业分为3大类18种具体类别,为了简化求解方法、提高求解速度和装箱效率,对最低层的2种组合不做线性规划求解,只是选择其中好的方案,以此作为基础数据,再对货箱3个维度分别规划求解,求出优化组合,给出简便快速优化装箱方法。该方法虽然优化程度略低,但方法更为简单、求解和装箱效率更高,优化程度较为理想。The traditional solution of packing problem is large,difficult to master and low packing efficiency,in order to overcome the problem,a new optimization solution is proposed,which divides the packing operation into three categories of 18 specific categories. In order to simplify the solution,improve the speed and packing efficiency,the two combinations of LOWEST STATION are not linear programming,only the good scheme,as the basic data,and three dimensions of the box are solved respectively,the optimization combination,and simple and fast packing method. Although the degree of optimization is slightly lower,but the method is simpler,the solution and packing efficiency is higher,and the optimization degree is more ideal.

关 键 词：单一货物 三维装箱问题 简便快速优化装箱方法 线性规划法 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]