The container loading problem

This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will be packed onto lower surfaces of the container, or packed in earlier containers. The solution found in one iteration of the algorithm is analyzed, and the priorities are updated to be used in the next iteration. Our algorithm outperformed all previous methods using standard benchmark data sets. We found the existing test data for the multiple container loading problem to be deficient and supplemented them by generating new test data consisting of 2800 test cases. The results from our algorithm using this data set are excellent. Categories and Subject Descriptors I.2.8 [ARTIFICIAL INTELLIGENCE]: Problem Solving, Control Methods, and Search—Heuristic methods General Terms Algorithms Keywords Container Loading, Heuristic

• Type: Conference
• Year: 2005
• Where: SAC
• Authors: Andrew Lim, Xingwen Zhang
• Keywords: Applied Computing, Box Type, Container Loading Problem, Multiple Container Loading, SAC 2005