Computer Engineering and Applications ›› 2020, Vol. 56 ›› Issue (17): 55-59.DOI: 10.3778/j.issn.1002-8331.1907-0393

Previous Articles     Next Articles

Machinability-Oriented Optimization Algorithm for Rectangular Items Cutting Stock Problem

LU Shufei, CHEN Yan, CUI Yaodong   

  1. College of Computer and Electronic Information, Guangxi University, Nanning 530004, China
  • Online:2020-09-01 Published:2020-08-31



  1. 广西大学 计算机与电子信息学院,南宁 530004


Many algorithms for the cutting stock problem of rectangular items concentrate on improving material utilization, but not fully address the cutting cost. This paper presents an algorithm that can obtain both better material utilization and lower cutting cost. The algorithm uses the SVC frame and normal multi-section patterns of homogenous strips to solve the cutting stock problem. It calculates the length of the cutting path by optimizing the path layout of homogeneous strips with common edge, and takes the production cost(the sum of material cost and cutting cost) as the optimization objective, to obtain the cutting plan with better material utilization and lower cutting cost. Finally, the feasibility and effectiveness of the proposed algorithm are verified by experiments.

Key words: machinability, rectangular items, sequential value correction, cutting stock, cutting cost



关键词: 可加工性, 矩形件, 顺序价值校正, 优化下料, 切割成本