Abstract
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baumann, T., Schömer, E., Werth, K.: Solving geometric packing problems based on physics simulation. In: ESA’07 (Submitted 2007)
Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing 7(3), 178–184 (2000)
Cagan, J., Ding, Q.: Automated trunk packing with extended pattern search. Virtual Engineering, Simulation & Optimization SP-1779, 33–41 (2003)
Eisenbrand, F., Funke, S., Karrenbauer, A., Reichel, J., Schömer, E.: Packing a trunk: now with a twist! In: SPM ’05: Proceedings of the 2005 ACM symposium on Solid and physical modeling, pp. 197–206. ACM Press, New York (2005)
Eisenbrand, F., Funke, S., Reichel, J., Schömer, E.: Packing a trunk. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 618–629. Springer, Heidelberg (2003)
Deutsches Institut für Normung e.V. DIN 70020, Teil 1, Straßenfahrzeuge; Kraftfahrzeugbau; Begriffe von Abmessungen (1993)
Kako, A., Ono, T., Hirata, T., Halldórsson, M.M.: Approximation algorithms for the weighted independent set problem. In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG, pp. 341–350 (2005)
Karrenbauer, A.: Packing boxes with arbitrary rotations. Master’s thesis, Universität des Saarlandes, Saarbrücken (2004)
Neumann, U.: Optimierungsverfahren zur normgerechten Volumenbestimmung von Kofferräumen im europäischen Automobilbau. Master’s thesis, Technische Universität Braunschweig, Braunschweig (2006)
Society of Automotive Engineers. SAE J1100, Motor Vehicle Dimensions (2001)
Reichel, J.: Combinatorial approaches for the Trunk packing problem. PhD thesis, Saarbrücken (2006)
Rieskamp, J.: Automation and Optimization of Monte Carlo Based Trunk Packing. Master’s thesis, Universität des Saarlandes, Saarbrücken (2005)
Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Appl. Math. 126(2-3), 313–322 (2003)
Schepers, J.: Exakte Algorithmen für orthogonale Packungsprobleme. PhD thesis, Köln (1997)
Warren, J.S., Hicks, I.V.: Combinatorial branch-and-bound for the maximum weight independent set problem (2006), http://ie.tamu.edu/people/faculty/Hicks/jeff.rev.pdf
Wottawa, M.: Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen. PhD thesis, Köln (1996)
Zimmermann, A.: AI Zimmerman’s Circle Packing Contest. Al Zimmerman’s Programming Contests (2005), http://www.recmath.org/contest/CirclePacking/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Althaus, E., Baumann, T., Schömer, E., Werth, K. (2007). Trunk Packing Revisited. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)