A note on “Reducing the number of binary variables in cutting stock problems-

详细信息    查看全文

• 作者：Hao-Chun Lu (1)
  Yu-Chien Ko (2)
  Yao-Huei Huang (3)
  
• 关键词：Deterministic model ; Cutting stock problem ; Binary variables
• 刊名：Optimization Letters
• 出版年：2014
• 出版时间：February 2014
• 年：2014
• 卷：8
• 期：2
• 页码：569-579
• 全文大小：300 KB
• 作者单位：Hao-Chun Lu (1)
  Yu-Chien Ko (2)
  Yao-Huei Huang (3)
  
  1. Department of Information Management, College of Management, Fu Jen Catholic University, No.510, Jhongjheng Road, Sinjhuang City, Taipei County, 242, Taiwan
  2. Department of Information Management, Chung Hua University, 707, Sec.2, WuFu Road, Hsinchu, 300, Taiwan
  3. Institute of Information Management, National Chiao Tung University, Management Building 2, 1001 Ta-Hsueh Road, Hsinchu, 300, Taiwan, ROC
  
• ISSN：1862-4480

文摘

This study proposes a deterministic model to solve the two-dimensional cutting stock problem (2DCSP) using a much smaller number of binary variables and thereby reducing the complexity of 2DCSP. Expressing a 2DCSP with $m$ stocks and $n$ cutting rectangles requires $2n^{2}+n(m+1)$ binary variables in the traditional model. In contrast, the proposed model uses $n^{2}+n\lceil {\log _2 m}\rceil $ binary variables to express the 2DCSP. Experimental results showed that the proposed model is more efficient than the existing model.