|
A modified wall-building-based compound approach for the knapsack container loading problem |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Ampol Karoonsoontawong 2. Krongthong Heebkhoksung |
| Title | A modified wall-building-based compound approach for the knapsack container loading problem |
| Publisher | Maejo University |
| Publication Year | 2558 |
| Journal Title | Maejo International Journal of Science and Technology |
| Journal Vol. | 9 |
| Journal No. | 1 |
| Page no. | 93 |
| Keyword | heuristic algorithm,knapsack container loading problem,wall-building algorithm |
| ISSN | 1905-7873 |
| Abstract | This paper considers the knapsack container loading problem. Rectangularshaped 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. |
