Reference : A Mixed Integer Programming formulation for the three dimensional bin packing problem...
Scientific journals : Article
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/2268/159225
A Mixed Integer Programming formulation for the three dimensional bin packing problem deriving from an air cargo application
English
Paquay, Célia mailto [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > UER Opérations : Logistique >]
Schyns, Michael mailto [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > UER Opérations : Informatique de gestion >]
Limbourg, Sabine mailto [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > UER Opérations : Logistique >]
2016
International Transactions in Operational Research
Blackwell Publishing
23
1-2
187-213
Yes (verified by ORBi)
International
0969-6016
[en] bin-packing ; mathematical formulation ; unit load devices
[en] The present paper looks into the problem of optimising the loading of boxes
into containers. The goal is to minimise the unused volume. This type of problem belongs
to the family of Multiple Bin Size Bin Packing Problems. The approach includes an extensive
set of constraints encountered in real-world applications in the three-dimensional case:
the stability, the fragility of the items, the weight distribution and the possibility to rotate
the boxes. It also includes the specific situation in which containers are truncated parallelepipeds.
This is typical in the field of air transportation. While most papers on cutting
and packing problems describe ad-hoc procedures, this paper proposes a mixed integer linear
program. The validity of this model is tested on small instances.
COMEX
http://hdl.handle.net/2268/159225
10.1111/itor.12111

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Restricted access
itor3.pdfAuthor preprint330.98 kBRequest copy

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.