Symmetry-breaking constraints for packing identical rectangles within polyhedra

Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly 90° rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest polyhedron of a given type that accommodates a fixed number of identical rectangles. Both problems are modeled as mixed integer programming problems. Symmetry-breaking constraints that facilitate the solution of the MIP models are introduced. Numerical results are presented.

[1]  Jeff T. Linderoth,et al.  Solving large Steiner Triple Covering Problems , 2011, Oper. Res. Lett..

[2]  Ernesto G. Birgin,et al.  Orthogonal packing of identical rectangles within isotropic convex regions , 2010, Comput. Ind. Eng..

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Ernesto G. Birgin,et al.  Using sentinels to detect intersections of convex and nonconvex polygons , 2010 .

[5]  Panos M. Pardalos,et al.  Minimax Problems in Combinatorial Optimization , 1995 .

[6]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[7]  Andrea Lodi,et al.  Integer linear programming models for 2-staged two-dimensional Knapsack problems , 2003, Math. Program..

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

[9]  Reinaldo Morabito,et al.  Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm , 2012, J. Oper. Res. Soc..

[10]  Reinaldo Morabito,et al.  A note on an L-approach for solving the manufacturer's pallet loading problem , 2005, J. Oper. Res. Soc..

[11]  José Mario Martínez,et al.  Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization , 2006, Comput. Oper. Res..

[12]  Andrea Cassioli,et al.  A heuristic approach for packing identical rectangles in convex regions , 2011, Comput. Oper. Res..

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

[14]  Wei Xie,et al.  A branch-and-bound algorithm for the continuous facility layout problem , 2008, Comput. Chem. Eng..

[15]  Josef Kallrath,et al.  Cutting circles and polygons from area-minimizing rectangles , 2009, J. Glob. Optim..

[16]  Ignacio E. Grossmann,et al.  A cutting plane method for solving linear generalized disjunctive programming problems , 2005, Comput. Chem. Eng..

[17]  Gerhard J. Woeginger,et al.  Complexity and approximation of an area packing problem , 2012, Optim. Lett..

[18]  P. Pardalos,et al.  Minimax and applications , 1995 .

[19]  José Mario Martínez,et al.  Method of sentinels for packing items within arbitrary convex regions , 2006, J. Oper. Res. Soc..

[20]  SOCIETY , 2008, Society.

[21]  Ignacio E. Grossmann,et al.  A cutting plane method for solving linear generalized disjunctive programming problems , 2003 .