Bin packing and cutting stock problems: Mathematical models and exact algorithms

We review the most important mathematical models and algorithms developed for the exact solution of the one-dimensional bin packing and cutting stock problems, and experimentally evaluate, on state-of-the art computers, the performance of the main available software tools.

[1]  Graham Kendall,et al.  A simulated annealing hyper-heuristic methodology for flexible decision support , 2012, 4OR.

[2]  A. K. Bhatia,et al.  Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic , 2004, ICONIP.

[3]  Cláudio Alves,et al.  New Stabilization Procedures for the Cutting Stock Problem , 2011, INFORMS J. Comput..

[4]  A. K. Bhatia,et al.  Better-Fit Heuristic for One-Dimensional Bin-Packing Problem , 2009, 2009 IEEE International Advance Computing Conference.

[5]  Gleb Belov.  Problems, Models and Algorithms in One- and Two-Dimensional Cutting , 2003 .

[6]  Richard E. Korf.  An Improved Algorithm for Optimal Bin Packing , 2003, IJCAI.

[7]  Richard E. Korf,et al.  Improved Bin Completion for Optimal Bin Packing and Number Partitioning , 2013, IJCAI.

[8]  José Torres-Jiménez,et al.  A grouping genetic algorithm with controlled gene transmission for the bin packing problem , 2015, Comput. Oper. Res..

[9]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[10]  Ian P. Gent.  Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[11]  Jirí Sgall,et al.  The optimal absolute ratio for online bin packing , 2015, SODA.

[12]  Guntram Scheithauer,et al.  Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem , 1997, Oper. Res. Lett..

[13]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..

[14]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

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

[16]  Daniele Vigo,et al.  Bin Packing Approximation Algorithms: Combinatorial Analysis , 1999, Handbook of Combinatorial Optimization.

[17]  Riccardo Poli,et al.  A histogram-matching approach to the evolution of bin-packing strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[19]  Alberto Caprara,et al.  Bidimensional packing by bilinear programming , 2005, Math. Program..

[20]  Bintong Chen,et al.  An Improved Lower Bound for the Bin Packing Problem , 1996, Discret. Appl. Math..

[21]  Graham Kendall,et al.  Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.

[22]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[23]  Gary M. Roodman.  Near-optimal solutions to one-dimensional cutting stock problems , 1986, Comput. Oper. Res..

[24]  Odile Marcotte.  An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[25]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[26]  György Dósa,et al.  Performance Guarantees for One-Dimensional Bin Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

[28]  Daniele Vigo,et al.  Two‐Dimensional Bin Packing Problems , 2014 .

[29]  Cláudio Alves,et al.  Dual-Feasible Functions for Integer Programming and Combinatorial Optimization: Basics, Extensions and Applications , 2016 .

[30]  Hugo Terashima-Marín,et al.  A hyper-heuristic for solving one and two-dimensional bin packing problems , 2011, GECCO '11.

[31]  Barry O'Sullivan,et al.  Propagating the Bin Packing Constraint Using Linear Programming , 2010, CP.

[32]  V. M. Kartak.  Sufficient Conditions for the Integer Round-Up Property to Be Violated for the Linear Cutting Stock Problem , 2004 .

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

[34]  János Csirik,et al.  A Classification Scheme for Bin Packing Theory , 2007, Acta Cybern..

[35]  João Pedro Pedroso,et al.  Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..

[36]  Cláudio Alves,et al.  Gomory Cuts from a Position-Indexed Formulation of 1D Stock Cutting , 2008 .

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

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

[39]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

[40]  Byung-In Kim,et al.  Last two fit augmentation to the well-known construction heuristics for one-dimensional bin-packing problem: an empirical study , 2010 .

[41]  Xin Yao,et al.  A new evolutionary approach to cutting stock problems with and without contiguity , 2002, Comput. Oper. Res..

[42]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

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

[44]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[45]  Samir Elhedhli,et al.  Characterizing the optimality gap and the optimal packings for the bin packing problem , 2015, Optim. Lett..

[46]  Kurt Eisemann,et al.  The Trim Problem , 1957 .

[47]  Rhyd Lewis,et al.  A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing , 2009, Comput. Oper. Res..

[48]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[49]  Aleksandar Nikolov,et al.  Beck's Three Permutations Conjecture: A Counterexample and Some Consequences , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[50]  Emma Hart,et al.  Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model , 2013, GECCO '13.

[51]  Adam Stawowy,et al.  Evolutionary based heuristic for bin packing problem , 2008, Comput. Ind. Eng..

[52]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[53]  Bassem Jarboui,et al.  A new destructive bounding scheme for the bin packing problem , 2010, Ann. Oper. Res..

[54]  Robert W. Haessler,et al.  Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..

[55]  Teodor Gabriel Crainic,et al.  Computing the asymptotic worst-case of bin packing lower bounds , 2007, Eur. J. Oper. Res..

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

[57]  Samir Elhedhli,et al.  Ranking lower bounds for the bin-packing problem , 2005, Eur. J. Oper. Res..

[58]  Philipp Rohlfshagen,et al.  A genetic algorithm with exon shuffling crossover for hard bin packing problems , 2007, GECCO '07.

[59]  Bruce L. Golden,et al.  Solving the one-dimensional bin packing problem with a weight annealing heuristic , 2008, Computers & Operations Research.

[60]  Odile Marcotte.  The cutting stock problem and integer rounding , 1985, Math. Program..

[61]  David P. Woodruff,et al.  Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error , 2011, TALG.

[62]  Colin Reeves,et al.  Hybrid genetic algorithms for bin-packing and related problems , 1996, Ann. Oper. Res..

[63]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[64]  T. Kampke.  Simulated Annealing: use of new tool in bin packing , 1988 .

[65]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[66]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[67]  Claude Berge,et al.  Coloring the Edges of A Hypergraph and Linear Programming Techniques , 1977 .

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

[69]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[70]  Daniele Vigo,et al.  Bin packing approximation algorithms: Survey and classification , 2013 .

[71]  Gerhard Wäscher,et al.  CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .

[72]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..

[73]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

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

[76]  Nicos Christofides,et al.  The Loading Problem , 1971 .

[77]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[78]  Mary P. Harper,et al.  A tight lower bound for optimal bin packing , 1995, Oper. Res. Lett..

[79]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

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

[81]  Alok Singh,et al.  Two heuristics for the one-dimensional bin-packing problem , 2007, OR Spectr..

[82]  Tobias Achterberg,et al.  Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[83]  Jacques Desrosiers,et al.  Cutting planes for branch‐and‐price algorithms , 2009, Networks.

[84]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[85]  T. Kampke.  Simulated annealing: Use of a new tool in bin packing , 1988 .

[86]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[87]  Philipp Rohlfshagen,et al.  Nature inspired genetic algorithms for hard packing problems , 2010, Ann. Oper. Res..

[88]  Guntram Scheithauer,et al.  The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .

[89]  Jirí Sgall,et al.  First Fit bin packing: A tight analysis , 2013, STACS.

[90]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

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

[92]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[93]  Andrea Lodi,et al.  Mixed Integer Programming Computation , 2010, 50 Years of Integer Programming.

[94]  Marcus Randall,et al.  A Hybrid Extremal Optimisation Approach for the Bin Packing Problem , 2009, ACAL.

[95]  Christoph Nitsche,et al.  Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..

[96]  R. W. Haessler,et al.  Cutting stock problems and solution procedures , 1991 .

[97]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[98]  Stephan Dempe,et al.  Large gaps in one-dimensional cutting stock problems , 2008, Discret. Appl. Math..

[99]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[100]  Krzysztof C. Kiwiel.  An Inexact Bundle Approach to Cutting-Stock Problems , 2010, INFORMS J. Comput..

[101]  R. Vahrenkamp,et al.  Random search in the one-dimensional cutting stock problem , 1996 .

[102]  J. Beck,et al.  Discrepancy Theory , 1996 .

[103]  Laurence A. Wolsey.  Valid inequalities, covering problems and discrete dynamic programs , 1977 .

[104]  Gleb Belov,et al.  Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..

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

[106]  Krzysztof Fleszar,et al.  Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem , 2011, Eur. J. Oper. Res..

[107]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[108]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[109]  Adam N. Letchford,et al.  Separation algorithms for 0-1 knapsack polytopes , 2010, Math. Program..

[110]  Sascha Kurz,et al.  Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem , 2014, Discret. Appl. Math..

[111]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[112]  Daniele Vigo,et al.  5. Two-Dimensional Bin Packing Problems , 2013 .

[113]  Teodor Gabriel Crainic,et al.  New bin packing fast lower bounds , 2007, Comput. Oper. Res..

[114]  Jean-Marie Bourjolly,et al.  An analysis of lower bound procedures for the bin packing problem , 2005, Comput. Oper. Res..

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

[116]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[117]  J. V. D. Carvalho,et al.  Cutting Stock Problems , 2005 .

[118]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[119]  Friedrich Eisenbrand,et al.  Bin packing via discrepancy of permutations , 2010, SODA '11.

[120]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[121]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[122]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[123]  Takayuki Osogami,et al.  Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics , 2003, J. Heuristics.

[124]  Paul Shaw,et al.  A Constraint for Bin Packing , 2004, CP.

[125]  Thomas Rothvoß,et al.  Approximating Bin Packing within O(log OPT * Log Log OPT) Bins , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[126]  Jirí Sgall,et al.  Optimal Analysis of Best Fit Bin Packing , 2014, ICALP.

[127]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .

[128]  H. Stadtler,et al.  A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems , 1988 .

[129]  José M. Valério de Carvalho,et al.  Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..

[130]  Guntram Scheithauer,et al.  A branch&bound algorithm for solving one-dimensional cutting stock problems exactly , 1995 .

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

[132]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[133]  Yves Deville,et al.  Consistency Check for the Bin Packing Constraint Revisited , 2010, CPAIOR.

[134]  Gleb Belov,et al.  Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) , 2000 .

[135]  Oliver Holthaus,et al.  Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths , 2002, Eur. J. Oper. Res..

[136]  Ben Paechter,et al.  A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution , 2012, PPSN.

[137]  Michel Minoux,et al.  A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems , 2002, Oper. Res. Lett..

[138]  Michael A. Trick.  A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints , 2003, Ann. Oper. Res..

[139]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[140]  Fred W. Glover,et al.  A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.

[141]  Cláudio Alves,et al.  Worst-case analysis of maximal dual feasible functions , 2012, Optim. Lett..

[142]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[143]  Claude Lemaréchal,et al.  Comparison of bundle and classical column generation , 2008, Math. Program..

[144]  Lap Mui Ann Chan,et al.  Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..

[145]  Cláudio Alves,et al.  A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..

[146]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[147]  François Vanderbeck,et al.  Branching in branch-and-price: a generic scheme , 2011, Math. Program..

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

[149]  Birger Raa,et al.  Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem , 2012, CP.

[150]  Richard E. Korf,et al.  A new algorithm for optimal bin packing , 2002, AAAI/IAAI.

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

[152]  Mohamed Haouari,et al.  Fast lifting procedures for the bin packing problem , 2005, Discret. Optim..

[153]  Jatinder N. D. Gupta,et al.  A new heuristic algorithm for the one-dimensional bin-packing problem , 1999 .

[154]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[155]  Mauro Dell'Amico,et al.  Friendly bin packing instances without Integer Round-up Property , 2015, Math. Program..

[156]  Ender Özcan,et al.  A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing , 2008, PPSN.