单一规格物体二维矩形条带装箱问题解法研究  

Research on the Solution of Two-dimensional Rectangular Strip Packing Problem in Single Specification Goods

作　　者：胡锦超[1] 贾春玉[1] HU Jin-chao JIA Chun-yu(School of Economics ＆ Management, Ningbo University of Technology, Ningbo 315211 ,China)

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

出　　处：《成组技术与生产现代化》2017年第2期6-8,共3页Group Technology & Production Modernization

基　　金：宁波市自然科学基金资助项目(2015A610174)

摘　　要：为了克服用启发式算法及智能搜索法解决单一规格物体二维矩形条带装箱问题耗时过长的缺陷,提出了新的解法和思路.用线性规划法分别在2个维度求最优解,以最好的方案作为近似最优解,可大幅度缩短求解时间,获得满意的近似最优解.The packing problem of two-dimensional rectangular strip is a big problem of NP. Although the two-dimensional bin packing can adopt the heuristic algorithm and intelligent search method, the time it takes usually very long. There have been some research results, bur it still needs improvement. To solve these problems, new solutions are put forward. The linear programming method is used to find the best solution among two dimensions and to use the best solution as the approximate optimal solution. In this way, the resolving time can be greatly reduced and the satisfied approximate optimal solution can be obtained. This method is relatively simple with high efficiency.

关 键 词：单一规格 装箱问题 启发式算法 线性规划解法 智能搜索法 

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