A branchbound algorithm for solving onedimensional cutting stock problems exactly, applica.pdfVIP

下载本文档

1
0
约3.37万字
约 17页
2017-04-05 发布于江苏
举报
版权申诉

A branchbound algorithm for solving onedimensional cutting stock problems exactly, applica.pdf

1、本文档共17页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Abranch

APPLICATIONES MATHEMATICAE 23,2 (1995), pp. 151–167 G. SCHEITHAUER and J. TERNO (Dresden) A BRANCHBOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY Abstract. Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear pro- gramming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP. In this paper we give a branchbound algorithm to compute optimal solutions for instances of the 1CSP. Numerical results are presented of about 900 randomly generated instances with up to 100 small pieces and all of them are optimally solved. 1. Introduction. The one-dimensional cutting stock problem (1CSP) is the following: One-dimensional material objects of a given length L are divided into smaller pieces of desired lengths l1, . . . , lm in order to fulfill the order demands b1, . . . , bm. The goal is to minimize the total amount of stock material or, equivalently, to minimize the total waste. It is well known [6] that the 1CSP can be modelled as a linear integer optimization problem as follows. Any feasible cutting pattern can be repre- sented by anm-dimensional nonnegative integer vector aj = (a1j , . . . , amj)T satisfying ∑m i=1 liaij ≤ L. Defining integer variables xj to give the number of stock material to be cut according to pattern aj one has 1991 Mathematics Subject Classification: 90C10, 90C05. Key words and phrases: integer optimization, cutting stock problem, branchbound, rounding. [151] 152 G. Scheithauer and J. Terno z = n∑ j=1 xj → min s.t. n∑ j=1 aijxj ≥ bi, i = 1, . . . ,m, xj ≥ 0, integer, j = 1, . . . , n, where n denotes the number of cutting patterns. Without loss of generality, all input data can be assumed to be integers, and in order to ensure solv- ability, we suppose maxi=1,...,m li ≤ L. Furthermor