Journal of Northeastern University Natural Science ›› 2018, Vol. 39 ›› Issue (6): 771-775.DOI: 10.12068/j.issn.1005-3026.2018.06.003

• Information & Control • Previous Articles     Next Articles

Non-guillotine Cutting Algorithm of Rectangular Items Based on Five-Homogeneous-Block Mode

ZHANG Rui-you, PAN Wei-ping, LIU Shi-xin   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2017-02-20 Revised:2017-02-20 Online:2018-06-15 Published:2018-06-22
  • Contact: PAN Wei-ping
  • About author:-
  • Supported by:
    -

Abstract: A type of non-guillotine cutting problem of rectangular items was studied based on the use of five-homogeneous-block mode. According to the idea of dynamic programming and implicit enumeration, a five-homogeneous-block cutting algorithm for an unconstrained non-guillotine cutting problem was designed. The comparative experiments with existing non-guillotine cutting algorithms indicated that optimal solutions of the problem could be quickly given by this algorithm, and both the difficulty of plate cutting process and the sorting cost of rectangular items could be reduced. Furthermore, comparisons with another experiment with two guillotine cutting algorithms show the benefits of “non-guillotine”.

Key words: non-guillotine cutting problem, five-block mode, dynamic programming algorithm, implicit enumeration

CLC Number: