A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application

The present paper discusses the problem of optimizing the loading of boxes into containers. The goal is to minimize the unused volume. This type of problem belongs to the family of multiple bin size bin packing problems (MBSBPP). The approach includes an extensive set of constraints encountered in r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research Jg. 23; H. 1-2; S. 187 - 213
Hauptverfasser: Paquay, C., Schyns, M., Limbourg, S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.01.2016
Blackwell Publishing
Schlagworte:
Air cargo
air transport
bin-packing
Boxes (containers)
Business & economic sciences
Containers
Cutting
Fragility
Integer programming
linear programming
loading problems
mathematical formulation
Mathematical models
Mixed integer
Méthodes quantitatives en économie & gestion
Operations research
Packing problem
packing problems
Quantitative methods in economics & management
Sciences économiques & de gestion
Studies
Three dimensional
unit load devices
weight distribution
ISSN:0969-6016, 1475-3995
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The present paper discusses the problem of optimizing the loading of boxes into containers. The goal is to minimize the unused volume. This type of problem belongs to the family of multiple bin size bin packing problems (MBSBPP). 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.
Bibliographie:ark:/67375/WNG-FCLB0ZB5-W
ArticleID:ITOR12111
istex:6FA8E0FD2F9F10B9382F7EF66E78EFE0F94FB7C3
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
COMEX project: Combinatorial Optimization: Metaheuristics and Exact methods
scopus-id:2-s2.0-84946498709
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.12111