A modified wall-building-based compound approach for the knapsack container loading problem
Journal article
Authors/Editors
Strategic Research Themes
No matching items found.
Publication Details
Author list: Karoonsoontawong A., Heebkhoksung K.
Publisher: Maejo University
Publication year: 2015
Journal: Maejo International Journal of Science and Technology (1905-7873)
Volume number: 9
Issue number: 1
Start page: 93
End page: 107
Number of pages: 15
ISSN: 1905-7873
Languages: English-Great Britain (EN-GB)
View in Web of Science | View on publisher site | View citing articles in Web of Science
Abstract
This paper considers the knapsack container loading problem. Rectangular-shaped boxes with different sizes are packed in rectangular-shaped containers according to a specified container sequence. Each container is filled such that the total loaded volume is maximised. All boxes with the same origin-destination pair may be rotated in six orthogonal directions without load-related and positioning constraints. The proposed approach performs 36 wall-building heuristic methods based on three ranking functions, two priority rules and six orthogonal rotations of containers. Three real-world test problems from a furniture company are employed. There is not a winning heuristic that performs best on the three test problems. The typical wall-building approach does not perform well when compared with considering all six orthogonal rotations of a container. In terms of the number of containers, the proposed approach can save up to 33% on the three problems, and the highest fill percentages in the best solutions are improved by up to 70.96% when compared with the manual solutions. In an additional experiment the proposed approach yields slightly lower (up to 5.38% and 3.64%) average fill percentages, with 94.47% and 87.94% shorter CPU time than the existing tree-search heuristic for the respective weakly and strongly heterogeneous problem instances. ฉ 2015 by Maejo University
Keywords
Heuristic algorithm, Knapsack container loading problem, Wall-building algorithm
Contact Information