Eine Heuristik für das mehrdimensionale Bin Packing Problem
Mack, Daniel
Bortfeldt, Andreas
book
book
book
Text
https://nbn-resolving.org/urn:nbn:de:hbz:708-dh3356
https://ub-deposit.fernuni-hagen.de/receive/
https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000668
doc-type:book
ddc: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.
2008
FernUniversität in Hagen
17 Seiten
deu
all rights reserved
info:eu-repo/semantics/restrictedAccess