Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (27): 214-216.DOI: 10.3778/j.issn.1002-8331.2010.27.060

• 工程与应用 • Previous Articles     Next Articles

A quick model for guillotine rectangle cutting problem

PENG Wen   

  1. College of Computer Science,North China Electric Power University,Beijing 102206,China
  • Received:2009-02-25 Revised:2009-08-21 Online:2010-09-21 Published:2010-09-21
  • Contact: PENG Wen


彭 文   

  1. 华北电力大学,计算机科学与技术学院,北京 102206
  • 通讯作者: 彭 文

Abstract: In order to solve the constrained rectangle cutting problem effectively,a quick model is proposed,which obtains the most optimal scheme by comparing the different layouts of the rectangles.Compared with those of the heuristic algorithms,the speed of the presented algorithm,which is based on the analytic computation completely,is improved remarkably,although the optimal solution can not be found by this algorithm.The experimental results show that the algorithm can get the satisfied layout within a short time and is a promising and efficient guillotine rectangle cutting method.

摘要: 为了有效地解决有约束的矩形件优化排样问题,提出一种快速的求解算法;通过比较待排样矩形件的不同排样模式,选择最优排样方案。算法完全基于解析计算,虽不能寻找理论最优解,但相比于各种启发式算法大大提高了排样速度。实验结果表明,算法能够在较短的计算时间内获得满意的排样效果,是一种效率较高的有约束矩形件排样算法。

CLC Number: