Input analysis of the distributor’s pallet loading problem

Abstract

Numerous studies have been conducted on the distributor’s pallet loading problem (DPLP) in order to find solution methods that are time efficient and produces results that are applicable in the real world. It is well known, that the complexity of the problem increases by the number of boxes to be packed on the pallet, but not much research focuses on other factors of input affecting the complexity. This paper proposes a model for solving the three-dimensional single pallet DPLP. Datasets are created specifically to conduct selected experiments to identify causes to increased computational time. The results yield a strong link between computation time and certain ratios of total volume of boxes to maximum capacity of the pallet as well as the amount of small vs. large boxes to be packed.