This project introduces an algorithm that solves the distributor's pallet packing problem. Unlike previous algorithms, we consider stack stability in addition to volume optimization as primary optimization criteria. Furthermore, our method natively handles cases where the construction of homogeneous layers of packages that have the same height is impossible due to differences in package heights and quantities. The algorithm consists of a nested beam search, separately optimizing local and global evaluation criteria. We demonstrate successful results on both real world and synthetic data sets.
|
|
|
Results of our algorithm on real world data from a beverage distributor
|
Different point of view of the same stack
|
Project Members:
Martin Schuster
Richard Bormann
Daniela Steidl
Saul Reynolds-Haertle
Mike Stilman
Publications:
M. Schuster, R. Bormann, D. Steidl, S. Reynolds-Haertle, M. Stilman. Stable Stacking for the Distributor’s Pallet Packing Problem. Int. Conf. on Intelligent Robots and Systems (IROS'10), 2010.
Data Sets:
