Abstract
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 × 2 × 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.
This work was partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1979)
Fowler, R.F., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133–137 (1981)
Milenkovic, V.J.: Rotational polygon containment and minimum enclosure using only robust 2d constructions. Computational Geometry 13, 3–19 (1999)
Daniels, K., Milenkovic, V.J.: Column-based strip packing using ordered and compliant containment. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol. 1148, pp. 33–38. Springer, Heidelberg (1996)
Cagan, J., Shimada, K., Yin, S.: A survey of computational approaches to threedimensional layout problems. Computer-Aided Design 34, 597–611 (2002)
Verweij, B., Aardal, K.: An optimisation algorithm for maximum independent set with applications in map labelling. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 426–437. Springer, Heidelberg (1999)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2. Springer, Heidelberg (1988)
Padberg, M.W.: On the facial structure of set packing polyhedra. Mathematical Programming 5, 199–215 (1973)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
Chvátal, V.: On certain polytopes associated with graphs. Journal of Combinatorial Theory Ser. B 18, 138–154 (1975)
Wolsey, L.: Faces for a linear inequality in 0-1 variables. Mathematical Programming 8, 165–178 (1975)
Nemhauser, G.L., Wolsey, L.A.: Integer programming. In: Nemhauser, G.L., et al. (eds.) Optimization. Handbooks in Operations Research and Management Science, vol. 1, pp. 447–527. Elsevier, Amsterdam (1989)
Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica 6, 365–379 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbrand, F., Funke, S., Reichel, J., Schömer, E. (2003). Packing a Trunk. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive