• 论文 •    

二维一刀切装箱问题的两阶段启发式算法

曹大勇,杨梅,科托夫·弗拉基米尔·米哈伊拉维奇,刘润涛   

  1. 1.哈尔滨理工大学 应用数学系,黑龙江哈尔滨150080;2.哈尔滨工业大学 电气工程系,黑龙江哈尔滨150001;3.白俄罗斯国立大学 应用数学与计算机系,白俄罗斯明斯克220030;4.哈尔滨理工大学 信息与科学计算技术研究所,黑龙江哈尔滨150080
  • 出版日期:2012-09-15 发布日期:2012-09-25

Two-stage heuristic algorithm for two-dimensional guillotine bin packing problem

CAO Da-yong, YANG Mei, V. M. Kotov, LIU Run-tao   

  1. 1.Department of Applied Mathematics, Harbin University of Science and Technology, Harbin 150080, China;2.Department of Electrical Engineering, Harbin Institute of Technology, Harbin 150001, China; 3.Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk 220030, Belarus;4.Institute of Information and Scientific Computing Technology, Harbin University of Science and Technology, Harbin 150080, China
  • Online:2012-09-15 Published:2012-09-25

摘要: 对用于二维带排样问题的Heuristic Recursive算法进行了调整,给出同一层中两个相邻浪费区域在满足一刀切约束下是否可合并的判定定理。构造了二维带排样问题的多递归层算法,并将它与一维装箱问题的最优匹配递减算法相结合,提出适应二维一刀切非旋转装箱问题的两阶段算法。在500组标准测试案例的基础上,与多种算法进行了比较。实验结果表明,所提算法在绝大多数测试案例上能够获得更好的排样布局。

关键词: 递归算法, 启发式算法, 一刀切, 二维非旋转装箱问题

Abstract: The Heuristic Recursive(HR)algorithm for two-dimensional strip packing problem was adjusted, and a judgment theorem which was used to determine whether two neighbor wasted spaces in same layer could be combine or not was presented. A multi-recursive algorithm for two-dimensional strip packing problem(2D-SPP)was constructed, and a Two-Stage Approach(TSA)for two-dimensional oriented guillotine bin packing problem was proposed by combining the algorithm with Best-Fit Decreasing(BFD)algorithm of one-dimensional bin packing problem. On the basis of 500 group benchmark problems, the approach was compared with multiple algorithms, the experiments showed that the proposed approach could obtain better results for almost all test instances.

Key words: recursive algorithms, heuristic algorithms, guillotine, 2D oriented bin packing problem

中图分类号: