A cutting stock problem in the wood products industry: a two-stage solution approach

被引:18
作者
Kokten, Erkan Sami [1 ]
Sel, Cagri [1 ]
机构
[1] Karabuk Univ, Dept Ind Engn, Fac Engn, TR-78050 Karabuk, Turkey
关键词
material and production planning; cutting stock problem; wood products industry; mathematical modeling; two-stage decomposition algorithm; simulated annealing metaheuristic; HEURISTIC ALGORITHM; ASSORTMENT PROBLEM; USABLE LEFTOVERS; MODEL; OPTIMIZATION; NUMBER; WASTE;
D O I
10.1111/itor.12802
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this study, a cutting stock problem is addressed to determine the width/length of the wooden boards and select lumber in standard lengths for cutting a cable spool. A nonlinear mathematical model is introduced using Pythagoras' theorem. The aim is to minimize the total length of lumber used and equivalently the total amount of wood wasted. To reduce the computational burden, the mathematical model is decomposed into two submodels for sizing and cutting decisions, and a two-stage decomposition algorithm is proposed for solving the submodels subsequently. A simulated annealing metaheuristic combining the first-fit decreasing and increasing techniques (SA-FFD/I) is proposed to show the computational efficiency of the decomposition approach. The savings on the total length of lumber used and the total amount of wood wasted in production are achieved by the decomposition algorithm, which is 8% and 86.4% on average compared to the SA-FFD/I heuristic. Accordingly, a numerical analysis is conducted on a real case to assess how capacity load and demand pattern scenarios impact the solution. The ratio between the total amount of wood waste and the total length of lumber does not exceed 2.54% for a weekly planning horizon.
引用
收藏
页码:879 / 907
页数:29
相关论文
共 74 条
[1]   On the cutting stock problem under stochastic demand [J].
Alem, Douglas Jose, Jr. ;
Munari, Pedro Augusto, Jr. ;
Arenales, Marcos Nereu ;
Valente Ferreira, Paulo Augusto .
ANNALS OF OPERATIONS RESEARCH, 2010, 179 (01) :169-186
[2]   A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem [J].
Aliano Filho, Angelo ;
Moretti, Antonio Carlos ;
Pato, Margarida Vaz .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (01) :91-107
[3]   Cutting stock with no three parts per pattern: Work-in-process and pattern minimization [J].
Aloisio, Alessandro ;
Arbib, Claudio ;
Marinelli, Fabrizio .
DISCRETE OPTIMIZATION, 2011, 8 (02) :315-332
[4]   A model approach to include wood properties in log sorting and transportation planning [J].
Andersson, Gert ;
Flisberg, Patrik ;
Nordstrom, Maria ;
Ronnqvist, Mikael ;
Wilhelmsson, Lars .
INFOR, 2016, 54 (03) :282-303
[5]   Two-stage two-dimensional guillotine cutting stock problems with usable leftover [J].
Andrade, R. ;
Birgin, E. G. ;
Morabito, R. .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (1-2) :121-145
[6]   An evolutionary algorithm for the one-dimensional cutting stock problem [J].
Araujo, Silvio A. ;
Constantino, Ademir A. ;
Poldi, Kelly C. .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2011, 18 (01) :115-127
[7]   One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model [J].
Arbib, Claudio ;
Marinelli, Fabrizio ;
Ventura, Paolo .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (1-2) :47-63
[8]   Process planning for aluminum tubes: An engineering-operations perspective [J].
Balakrishnan, A ;
Brown, S .
OPERATIONS RESEARCH, 1996, 44 (01) :7-20
[9]  
Berberler ME, 2010, APPL COMPUT MATH-BAK, V9, P19
[10]  
Berberler Murat., 2011, J KING SAUD UNIV SCI, V23, P69, DOI [DOI 10.1016/j.jksus.2010.06.009, 10.1016/j.jksus.2010.06.009]