Packing a Trunk

We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car trunk, the aim is to pack as many identical boxes of size 4 x 2 x 1 units as possible into the interior of the trunk. This measure is important for car manufacturers, because it is a standard in the European Union. First, we prove that a natural formal variant of this problem is NP-complete. Further, we use a combination of integer linear programming techniques and heuristics that exploit the geometric structure to attack this problem. Our experiments show that for all considered instances, we can get very close to the optimal solution in reasonable time.

[1]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[2]  G. Nemhauser,et al.  Integer Programming , 2020 .

[3]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[4]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[5]  Jonathan Cagan,et al.  A survey of computational approaches to three-dimensional layout problems , 2002, Comput. Aided Des..

[6]  Laurence A. Wolsey,et al.  Chapter VI Integer programming , 1989 .

[7]  Karen Aardal,et al.  An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling , 1999, ESA.

[8]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[9]  Victor J. Milenkovic,et al.  Rotational polygon containment and minimum enclosure using only robust 2D constructions , 1999, Comput. Geom..

[10]  V. Chvátal On certain polytopes associated with graphs , 1975 .

[11]  Bert Gerards,et al.  Matrices with the edmonds—Johnson property , 1986, Comb..

[12]  Victor J. Milenkovic,et al.  Column-Based Strip Packing Using Ordered and Compliant Containment , 1996, WACG.

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

[14]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[15]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..