An effective placement method for the single container loading problem

Publication Type:
Journal Article
Citation:
Computers and Industrial Engineering, 2016, 97 pp. 212 - 221
Issue Date:
2016-07-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Accepted Manuscript.pdfAccepted Manuscript Version792.71 kB
Adobe PDF
© 2016 Elsevier Ltd. All rights reserved. This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.
Please use this identifier to cite or link to this item: