https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000668https://ub-deposit.fernuni-hagen.de/servlets/MCRFileNodeServlet/mir_derivate_00000729/Mack_Bortfeldt_Heuristik_2008.pdfhttps://ub-deposit.fernuni-hagen.de/rsc/thumbnail/mir_mods_00000668.png
book
book
text
423
text
series
Diskussionsbeiträge der Fakultät für Wirtschaftswissenschaft der FernUniversität in Hagen
Hagen
FernUniversität in Hagen
2833658-6
de
en
pbl
Publisher
FernUniversität in Hagen. Fakultät für Wirtschaftswissenschaft
Heuristik für das mehrdimensionale Bin Packing Problem
Eine
aut
Author
Mack, Daniel
124078087
Mack
Daniel
aut
Author
Bortfeldt, Andreas
102786321
Bortfeldt
Andreas
Hagen
FernUniversität in Hagen
2008
urn:nbn:de:hbz:708-dh3356
17 Seiten
de
330
Bin packing
Single Bin-Size Bin Packing Problem
SBSBPP
Single Stock-Size Cutting Stock Problem
SSSCSP
heuristic
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.
mir_mods_00000668https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000668