The Knapsack Problem with Three Practical Constraints

Abstract This paper considers practical constraints for the unconstrained knapsack problem in its two- dimensional version, using integer programming. We first present an integer formulation for this knapsack problem, so couple constraints related with load balance, vertical (cargo) stability and fragility of the items also called load bearing. Using C language and the CPLEX solver, good results are obtained in an acceptable runtime considering instances from the literature.

[1]  Yoshiko Wakabayashi,et al.  Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing , 2012, Comput. Oper. Res..

[2]  Bohdan L. Kaluzny,et al.  Optimal aircraft load balancing , 2009, Int. Trans. Oper. Res..

[3]  Yoshiko Wakabayashi,et al.  Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation , 2008, Eur. J. Oper. Res..

[4]  R. Hibbeler.  Statics and Mechanics of Materials , 1995 .

[5]  Nelson Maculan,et al.  A greedy search for the three‐dimensional bin packing problem: the packing static stability case , 2003 .

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

[7]  Guntram Scheithauer.  Equivalence and Dominance for Problems of Optimal Packing of Rectangles , 1995 .

[8]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..

[9]  Reinaldo Morabito,et al.  An and—or-graph approach for two-dimensional cutting problems , 1992 .

[10]  Guntram Scheithauer,et al.  The G4-Heuristic for the Pallet Loading Problem , 1996 .

[11]  Reinaldo Morabito,et al.  Three-dimensional container loading models with cargo stability and load bearing constraints , 2012, Comput. Oper. Res..

[12]  Mhand Hifi,et al.  Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems , 2001, Comput. Optim. Appl..

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

[14]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

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

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

[17]  Flávio Keidi Miyazawa,et al.  Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints , 2013 .

[18]  Michel Gendreau,et al.  A Tabu Search Algorithm for a Routing and Container Loading Problem , 2006, Transp. Sci..

[19]  Reinaldo Morabito,et al.  An effective recursive partitioning approach for the packing of identical rectangles in a rectangle , 2010, J. Oper. Res. Soc..