TY - CHAP AU - Mack, Daniel AU - Bortfeldt, Andreas PY - 2008 DA - 2008// TI - Heuristik für das mehrdimensionale Bin Packing Problem Eine BT - Diskussionsbeiträge der Fakultät für Wirtschaftswissenschaft der FernUniversität in Hagen VL - 423 PB - FernUniversität in Hagen CY - Hagen KW - Bin packing KW - Single Bin-Size Bin Packing Problem KW - SBSBPP KW - Single Stock-Size Cutting Stock Problem KW - SSSCSP KW - heuristic AB - 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. L1 - https://ub-deposit.fernuni-hagen.de/servlets/MCRFileNodeServlet/mir_derivate_00000729/Mack_Bortfeldt_Heuristik_2008.pdf UR - https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000668 LA - de ID - mir_mods_00000668 ER -