Three dimensional Bin Packing Problem applied to air cargo

in ILS 2012 Proceedings (2012, August 26)

Deciding whether a set of three dimensional boxes can be packed into a container is a NP-hard problem. Mathematical models have been developed, however, only few studies take into account constraints ... [more ▼]

Deciding whether a set of three dimensional boxes can be packed into a container is a NP-hard problem. Mathematical models have been developed, however, only few studies take into account constraints encountered in real-world applications such as the stability or the fragility of the cargo. Moreover, despite the importance of this issue in air transport, the literature is almost silent on constraints related to the distribution of the weight inside a container. This paper is concerned with the formulation of the three dimensional palletization which includes the main constraints met in the air cargo industry. [less ▲]

Three dimensional Bin Packing Problem applied to air transport

Conference (2012, February 02)

Packing boxes into containers is a daily process in many di erent elds and especially in transport. However, the particular case of air transport brings some new constraints such as the stability or the ... [more ▼]

Packing boxes into containers is a daily process in many di erent elds and especially in transport. However, the particular case of air transport brings some new constraints such as the stability or the fragility of the cargo. The distribution of the weight has also to be considered. Moreover, this special case also brings some data such as the dimensions of the possible containers, called Unit Load Devices. This paper is concerned with the formulation of the three dimensional palletization which includes the main constraints met in the air cargo industry. It proposes a integer linear program for this combinatorial optimization problem. [less ▲]