Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry

This study examines a two-stage two-dimensional cutting stock problem encountered by a paper mill company. The problem includes various machine-related and operational constraints based on real-world situations. Paper products are manufactured using two major cutting processes. Each cutting machine has a specific minimum and maximum width for input and output rolls and is limited by the maximum number of rolls it can cut at the same time. A mathematical model is presented to formally address the problem and an efficient multiple-choice knapsack-based heuristic algorithm is proposed to solve the problem. To demonstrate the efficiency of the proposed heuristic algorithm, computational experiments are conducted on test data-set generated from real-world data provided by a large paper mill company in the Republic of Korea.

[1]  Eugene J. Zak.  Modeling multistage cutting stock problems , 2002, Eur. J. Oper. Res..

[2]  Toshihide Ibaraki,et al.  One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming , 2006, J. Math. Model. Algorithms.

[3]  Franklina Maria Bragion Toledo,et al.  A coupling cutting stock-lot sizing problem in the paper industry , 2007, Ann. Oper. Res..

[4]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[5]  Marcos Nereu Arenales,et al.  Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths , 2009, Comput. Oper. Res..

[6]  Robert W. Haessler,et al.  One-dimensional cutting stock problems and solution procedures , 1992 .

[7]  Voratas Kachitvichyanukul,et al.  An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems , 2013 .

[8]  R. Morabito,et al.  Linear models for 1-group two-dimensional guillotine cutting problems , 2006 .

[9]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[10]  Mitsuo Gen,et al.  Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems , 2012 .

[11]  Paolo Toth,et al.  A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size , 2012, Eur. J. Oper. Res..

[12]  Alain Martel,et al.  Roll assortment optimization in a paper mill: An integer programming approach , 2008, Comput. Oper. Res..

[13]  Gerhard Wäscher.  An LP-based approach to cutting stock problems with multiple objectives , 1990 .

[14]  An LP-based approach to a two-stage cutting stock problem , 1995 .

[15]  Sartaj Sahni,et al.  Data Structures, Algorithms, and Applications in C++ , 1997 .

[16]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[17]  Robert W. Haessler,et al.  Solving the two-stage cutting stock problem , 1979 .

[18]  Eugene J. Zak.  Row and column generation technique for a multistage cutting stock problem , 2002, Comput. Oper. Res..

[19]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[20]  Cláudio Alves,et al.  Arc-flow model for the two-dimensional guillotine cutting stock problem , 2010, Comput. Oper. Res..

[21]  T. Ibaraki,et al.  THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .

[22]  Constantine Goulimis.  Optimal solutions for the cutting stock problem , 1990 .

[23]  J. Soeiro Ferreira,et al.  A two-phase roll cutting problem , 1990 .

[24]  Gerhard Wäscher,et al.  EXTENSIONS OF CUTTING PROBLEMS: SETUPS* , 2013 .

[25]  Silvio A. de Araujo,et al.  An evolutionary algorithm for the one-dimensional cutting stock problem , 2011, Int. Trans. Oper. Res..

[26]  Mehdi Mrad,et al.  A branch-and-price algorithm for the two-stage guillotine cutting stock problem , 2013, J. Oper. Res. Soc..

[27]  Linus Schrage,et al.  Order Allocation for Stock Cutting in the Paper Industry , 2002, Oper. Res..

[28]  David Pisinger.  A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[29]  José Fernando Oliveira,et al.  Reel and sheet cutting at a paper mill , 2004, Comput. Oper. Res..

[30]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[31]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .