Eine Heuristik für das mehrdimensionaleBin Packing Problem

The more-dimensional bin packing problem (BPP) considered here requires packing a set ofrectangular shaped items into a minimum number of identical rectangular shaped bins. All itemsmay be rotated and the guillotine constraint has to be respected. A straightforward heuristic ispresented that is based on a method for the container loading problem following a wall-buildingapproach and on a procedure for the one-dimensional BPP. 1800 new benchmark instances areintroduced for the two-dimensional and for the three-dimensional BPP. The instances includemore than 1500 items on average.[...]