›› 2011, Vol. 24 ›› Issue (1): 50-.

• 论文 • 上一篇    下一篇



  1. (上海师范大学 信息与机电工程学院,上海 200234)
  • 出版日期:2011-01-15 发布日期:2010-12-30
  • 作者简介:杨彩君(1984-),女,硕士研究生。研究方向:计算机辅助设计。

A Filling Heuristic Algorithm for the Two-dimensional Rectangle Packing Problem

 YANG Cai-Jun, ZHANG Yu-Ping   

  1. (College of Mechanical and Electronic Engineering,Shanghai Normal University,Shanghai 200234,China)
  • Online:2011-01-15 Published:2010-12-30



关键词: 排样, 矩形件, 启发式, 填充式算法


The packing problem of cutting the optimal layout of small rectangles on a pallet is considered.Combining the ant algorithm with the simulated annealing algorithm,a mixed new algorithm of layout optimization,which is implemented by the lowest horizontal and filling algorithm,is proposed in this paper.In order to investigate the computation,numerical tests with randomly generated instances are carried out.By comparison,the solutions show the robust effectiveness of this approach.The results show that this approach achieves a better effect.

Key words: packing problem;rectangle;heuristics;filling algorithm


  • TP301.6