Reference : Instances for the 3D Multiple Bin Size Bin Packing Problem
Computer developments : Textual, factual or bibliographical database
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/2268/206856
Instances for the 3D Multiple Bin Size Bin Packing Problem
English
Paquay, Célia mailto [Université de Liège > HEC Liège : UER > UER Opérations : Logistique >]
Limbourg, Sabine mailto [Université de Liège > HEC Liège : UER > UER Opérations : Logistique >]
Schyns, Michael mailto [Université de Liège > HEC Liège : UER > UER Opérations : Informatique de gestion >]
2017
2017
[en] bin packing ; Unit Load device ; transportation constraints
[en] The subject of this work is to solve the problem of packing a set of shipments (various cuboid boxes) into containers of various shapes without wasting loading space. All the boxes have to be loaded and few are identical. As it is the case for all the packing problems, the packing has to satisfy geometry constraints: the items cannot overlap and have to lie entirely inside the bins. The richness of our application is to manage additional and common constraints: the bin weight capacity, the rotations of the boxes, the stability and the fragility of the boxes and the uniformity of the weight distribution inside the ULDs. The last constraint is crucial in air transportation: when ULDs are packed inside the airplane, the centre of gravity is computed assuming each ULD has a centre of gravity close to the geometrical centre of its basis. This type of constraints can be adapted to road transportation for the axle weight limits, which plays a key role since the weigh-in-motion systems become more common.
http://hdl.handle.net/2268/206856

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
data_sets.zipPublisher postprint496.79 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.