Solving the Three-Dimensional Palet-Paking Problem Using Mixed 0 - 1 Model

HTML  Download Download as PDF (Size: 313KB)  PP. 513-522  
DOI: 10.4236/jssm.2011.44059    6,316 Downloads   10,645 Views  Citations

Affiliation(s)

.

ABSTRACT

The distribution of Pallet Packing Problem is to load a set of distinct boxes with given dimensions on pallets or in con- tainers to maximize volume utilization. This problem is still in its early stages of research, but there is a high level of interest in developing effective models to solve this NP-hard problem to reduce the time, energy and other resources spent in packing pallets. In this paper, the three-dimensional pallet loading with mixed box sizes model has been developed. This loading model allows many boxes of various sizes to be placed onto the same pallet. The model also considers the number or proportion of each box size that can be loaded on a pallet. No restrictions are placed on the dimensions of the boxes, the pallets, or the number of different box sizes that can be considered. Therefore, the objective of this work is to determine how to most efficiently load a given pallet by maximizing the volume occupied by its load of boxes. Tests on several problems were implemented using OR library in order to show the validation of the proposed model. The results showed that the formulated mixed 0 - 1 models provide exact solutions for the pallet-packing problem. The computational time requirements of the developed model prevent its use in real-time palletizing applications. As microcomputer chip technology continues to evolve the lengthy computation time may prove to be less of a problem in real time applications.

Share and Cite:

Al-Shayea, A. (2011) Solving the Three-Dimensional Palet-Paking Problem Using Mixed 0 - 1 Model. Journal of Service Science and Management, 4, 513-522. doi: 10.4236/jssm.2011.44059.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.