Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
