An improved typology of cutting and packing problems

The number of publications in the area of Cutting and Packing (C&P) has increased considerably over the last two decades. The typology of C&P problems introduced by Dyckhoff [Dyckhoff, H., 1990. A typology of cutting and packing problems. European Journal of Operational Research 44, 145–159] initially provided an excellent instrument for the organisation and categorisation of existing and new literature. However, over the years also some deficiencies of this typology became evident, which created problems in dealing with recent developments and prevented it from being accepted more generally. In this paper, the authors present an improved typology, which is partially based on Dyckhoff’s original ideas, but introduces new categorisation criteria, which define problem categories different from those of Dyckhoff. Furthermore, a new, consistent system of names is suggested for these problem categories. Finally, the practicability of the new scheme is demonstrated by using it as a basis for a categorisation of the C&P literature from the years between 1995 and 2004. � 2006 Elsevier B.V. All rights reserved.

[1]  J. A. George,et al.  Packing different-sized circles into a rectangular container , 1995 .

[2]  J. Oliveira,et al.  Solving nesting problems with non‐convex polygons by constraint logic programming , 2003 .

[3]  G. Abdou,et al.  3D random stacking of weakly heterogeneous palletization problems , 1999 .

[4]  Eberhard E. Bischoff,et al.  A comparative evaluation of heuristics for container loading , 1990 .

[5]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

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

[7]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..

[8]  Gilbert Laporte,et al.  Upper bounds and algorithms for the maximum cardinality bin packing problem , 2003, Eur. J. Oper. Res..

[9]  E. E. Bischoff,et al.  Loading Multiple Pallets , 1995 .

[10]  Sungsoo Park,et al.  Algorithms for the variable sized bin packing problem , 2003, Eur. J. Oper. Res..

[11]  Michael Eley A bottleneck assignment approach to the multiple container loading problem , 2003 .

[12]  Jan Riehme,et al.  The solution of two-stage guillotine cutting stock problems having extremely varying order demands , 1996 .

[13]  Yoshiko Wakabayashi,et al.  An algorithm for the three-dimensional packing problem with asymptotic performance analysis , 1997, Algorithmica.

[14]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[15]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .

[16]  Thom J. Hodgson,et al.  A Combined Approach to the Pallet Loading Problem , 1982 .

[17]  Gerhard Wäscher,et al.  Simulated annealing for order spread minimization in sequencing cutting patterns , 1998, Eur. J. Oper. Res..

[18]  Daniele Vigo,et al.  Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..

[19]  Anders Thorstenson,et al.  A combined cutting-stock and lot-sizing problem , 2000, Eur. J. Oper. Res..

[20]  Gleb Belov,et al.  A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..

[21]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[22]  Horacio Hideki Yanasse On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..

[23]  J. A. George,et al.  A Method for Solving Container Packing for a Single Size of Box , 1992 .

[24]  Andreas Drexl,et al.  A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.

[25]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[26]  K. Dowsland An exact algorithm for the pallet loading problem , 1987 .

[27]  Reinaldo Morabito,et al.  An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container , 2002, Eur. J. Oper. Res..

[28]  J. A. George,et al.  A heuristic for packing boxes into a container , 1980, Comput. Oper. Res..

[29]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[30]  Miro Gradisar,et al.  A hybrid approach for optimization of one-dimensional cutting , 1999, Eur. J. Oper. Res..

[31]  Reinaldo Morabito,et al.  A simple and effective recursive procedure for the manufacturer's pallet loading problem , 1998, J. Oper. Res. Soc..

[32]  José Fernando Oliveira,et al.  Cylinder packing by simulated annealing , 2000 .

[33]  Edward G. Coffman,et al.  Approximation Algorithms for Extensible Bin Packing , 2001, SODA '01.

[34]  P. Y. Wang,et al.  Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..

[35]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[36]  V. Milenkovic,et al.  Translational polygon containment and minimal enclosure using mathematical programming , 1999 .

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

[38]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

[39]  Y. Stoyan,et al.  Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints , 1998 .

[40]  V. Milenkovic,et al.  Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .

[41]  Nicos Christofides,et al.  An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .

[42]  Daniele Vigo,et al.  Models and Bounds for Two-Dimensional Level Packing Problems , 2004, J. Comb. Optim..

[43]  José Mario Martínez,et al.  Optimizing the packing of cylinders into a rectangular container: A nonlinear approach , 2005, Eur. J. Oper. Res..

[44]  David Pisinger An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[45]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

[46]  M R Rao On the cutting stock problem , 1976 .

[47]  M.S.W. Ratcliff,et al.  Loading pallets with non-identical items , 1995 .

[48]  Guntram Scheithauer A Three-dimensional Bin Packing Algorithm , 1991, J. Inf. Process. Cybern..

[49]  Kenneth V. Richardson,et al.  Establishing the optimality of sequencing heuristics for cutting stock problems , 1995 .

[50]  Kathryn A. Dowsland,et al.  Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting , 2001, Manag. Sci..

[51]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[52]  J. Beasley Bounds for Two-Dimensional Cutting , 1985 .

[53]  John E. Beasley A population heuristic for constrained two-dimensional non-guillotine cutting , 2004, Eur. J. Oper. Res..

[54]  Gerhard Wäscher,et al.  Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .

[55]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[56]  Guillermo A. Mendoza,et al.  Solution procedures for cutting lumber into furniture parts , 1994 .

[57]  Guntram Scheithauer,et al.  4-Block heuristic for the rectangle packing problem , 1998, Eur. J. Oper. Res..

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

[59]  José Fernando Oliveira,et al.  Algorithms for Nesting Problems , 1993 .

[60]  J. C. Herz,et al.  Recursive computational procedure for two-dimensional stock cutting , 1972 .

[61]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[62]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[63]  Miro Gradisar,et al.  Evaluation of algorithms for one-dimensional cutting , 2002, Comput. Oper. Res..

[64]  Herbert Freeman,et al.  A Multistage Solution of the Template-Layout Problem , 1970, IEEE Trans. Syst. Sci. Cybern..

[65]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[66]  G L Nemhauser,et al.  A Cutting Plane Algorithm , 2002 .

[67]  Mhand Hifi,et al.  Approximate algorithms for constrained circular cutting problems , 2004, Comput. Oper. Res..

[68]  Miro Gradisar,et al.  A sequential heuristic procedure for one-dimensional cutting , 1999, Eur. J. Oper. Res..

[69]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[70]  Boon J. Yuen Improved heuristics for sequencing cutting patterns , 1995 .

[71]  Chengbin Chu,et al.  Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms , 2001, SIAM J. Comput..

[72]  Adrian Smith,et al.  An Algorithm to Optimize the Layout of Boxes in Pallets , 1980 .

[73]  Alberto Caprara,et al.  On the two-dimensional Knapsack Problem , 2004, Oper. Res. Lett..

[74]  Yoshiko Wakabayashi,et al.  Cube packing , 2003, Theor. Comput. Sci..

[75]  S. Voß,et al.  Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .

[76]  B. Golden Approaches to the Cutting Stock Problem , 1976 .

[77]  B. Kröger Guillotineable bin packing: A genetic approach , 1995 .

[78]  Sándor P. Fekete,et al.  A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems , 1997, ESA.

[79]  Peter Brucker Scheduling algorithms (4. ed.) , 2004 .

[80]  Mhand Hifi Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study , 2004, Comput. Oper. Res..

[81]  Harold J. Steudel,et al.  Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem , 1979 .

[82]  Mhand Hifi,et al.  A best-first branch-and-bound algorithm for orthogonal rectangular packing problems , 1998 .

[83]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[84]  Andreas Bortfeldt,et al.  A tabu search algorithm for weakly heterogeneous container loading problems , 1998 .

[85]  Hans Kellerer,et al.  Algorithms for on-line bin-packing problems with cardinality constraints , 2004, Discret. Appl. Math..

[86]  Jon Rigelsford,et al.  Scheduling Computer and Manufacturing Processes 2nd Edition , 2002 .

[87]  Zheng Da-zhong Simulated Annealing for Designing Higher-Order Digital Differentiator , 2001 .

[88]  Daniele Vigo,et al.  An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..

[89]  Reinaldo Morabito,et al.  Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach , 1996 .

[90]  Eberhard E. Bischoff,et al.  Allowing for weight considerations in container loading , 1998 .

[91]  G. Scheithauer LP‐based bounds for the container and multi‐container loading problem , 1999 .

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

[93]  Andreas Bortfeldt,et al.  Eine Heuristik für Multiple Containerladeprobleme , 2000, OR Spectr..

[94]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[95]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[96]  Jörg Heuer,et al.  Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten , 2004 .

[97]  Hermann Gehring,et al.  Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat , 1997 .

[98]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[99]  Kenneth Schilling The growth of m-constraint random knapsacks , 1990 .

[100]  Patrick Healy,et al.  A Local Optimization-based Solution to the Rectangle Layout Problem , 1996 .

[101]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[102]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[103]  François Vanderbeck,et al.  Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..

[104]  L. Kos,et al.  Cutting optimization with variable-sized stock and inventory status data , 2002 .

[105]  Jan Riehme,et al.  An efficient approach for the multi-pallet loading problem , 2000, Eur. J. Oper. Res..

[106]  Olli Nevalainen,et al.  On-line packing with boxes of different sizes , 1998 .

[107]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[108]  François Vanderbeck,et al.  A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..

[109]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[110]  José Fernando Oliveira,et al.  TOPOS – A new constructive algorithm for nesting problems , 2000, OR Spectr..

[111]  S. Das,et al.  Binary knapsack problems with random budgets , 2003, J. Oper. Res. Soc..

[112]  José Fernando Oliveira,et al.  A New Upper Bound for the Cylinder Packing Problem , 2001 .

[113]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

[114]  Yu. G. Stoyan,et al.  A method of optimal lattice packing of congruent oriented polygons in the plane , 2000, Eur. J. Oper. Res..

[115]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[116]  Nicos Christofides,et al.  An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..

[117]  Maing-Kyu Kang,et al.  A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems , 2003, Oper. Res. Lett..

[118]  Stefano Benati An algorithm for a cutting stock problem on a strip , 1997 .

[119]  Daniele Vigo,et al.  Heuristic algorithms for the three-dimensional bin packing problem , 2002, Eur. J. Oper. Res..

[120]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[121]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[122]  Günther R. Raidl,et al.  Genetic Algorithms for the Multiple Container Packing Problem , 1998, PPSN.

[123]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[124]  Heinz Isermann,et al.  Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße , 1991 .