000K utf8 1100 $c2008 1500 ger 2050 urn:nbn:de:hbz:708-dh3356 3000 Mack, Daniel 3010 Bortfeldt, Andreas 4000 Heuristik für das mehrdimensionale Bin Packing Problem$hFernUniversität in Hagen [Mack, Daniel] 4030 Hagen$nFernUniversität in Hagen 4060 17 Seiten 4209 The more-dimensional bin packing problem (BPP) considered here requires packing a set of rectangular shaped items into a minimum number of identical rectangular shaped bins. All items may be rotated and the guillotine constraint has to be respected. A straightforward heuristic is presented that is based on a method for the container loading problem following a wall-building approach and on a procedure for the one-dimensional BPP. 1800 new benchmark instances are introduced for the two-dimensional and for the three-dimensional BPP. The instances include more than 1500 items on average. Applied to these very large instances, the heuristic generates solutions of acceptable quality in short computation times. Moreover, the influence of different instance parameters on the solution quality is investigated by an extended computational study. 4950 https://nbn-resolving.org/urn:nbn:de:hbz:708-dh3356$xR$3Volltext$534 4961 https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000668 5051 330 5550 Bin packing 5550 heuristic 5550 SBSBPP 5550 Single Bin-Size Bin Packing Problem 5550 Single Stock-Size Cutting Stock Problem 5550 SSSCSP