Trunk Packing Revisited

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.

• Type: Conference
• Year: 2007
• Where: WEA
• Authors: Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth
• Keywords: Algorithms, Branch-and-bound Packing Algorithm, Different Box Sizes, Trunk Packing Problems, WEA 2007