3D random stacking of weakly heterogeneous palletization problems
Document Type
Article
Publication Date
1-1-1999
Abstract
Random stacking is a new procedure by which boxes of various dimensions are loaded on pallets without a predefined pattern. The proposed heuristic has been developed in order to solve weakly heterogeneous/online palletization problems, in which boxes of different dimensions arrive online to the pallet loading area in random order. The main objectives of the heuristic are maximizing the volumetric pallet utilization, minimizing the work-in-process as well as the robotic palletization time. New performance indices are established: the Total Number of Subvolume (TNSV), the Partitioned Remaining Volume Load Capacity (PRVLC), and the Total Zero Count (TZC). A computer program, written in Turbo C+ +, has been developed to simulate the palletization process. Ten simulations were conducted to generate the solution for different random sequences. © 1999 Taylor & Francis Group, LLC.
Identifier
0033132183 (Scopus)
Publication Title
International Journal of Production Research
External Full Text Location
https://doi.org/10.1080/002075499191102
e-ISSN
1366588X
ISSN
00207543
First Page
1505
Last Page
1524
Issue
7
Volume
37
Recommended Citation
Abdou, G. and Elmasry, M., "3D random stacking of weakly heterogeneous palletization problems" (1999). Faculty Publications. 16142.
https://digitalcommons.njit.edu/fac_pubs/16142
