Ha, C, Nguyen, TT, Bui, T and Wang, R (2017) An online packing heuristic for the three-dimensional container loading problem in dynamic environments and the Physical Internet. Lecture Notes in Computer Science, 10200. pp. 140-155. ISSN 0302-9743
Preview |
Text
report Evo v.8_Thanh_submitted.pdf - Accepted Version Download (688kB) | Preview |
Abstract
In this paper, we consider the online three-dimensional container loading problem. We develop a novel online packing algorithm to solve the three-dimensional bin packing problem in the online case where items are not know well in advance and they have to be packed in real-time when they ar-rive. This is relevant in many real-world scenarios such as automated cargo loading in warehouses. This is also relevant in the new logistics model of Physical Internet. The effectiveness of the online packing heuristic is evalu-ated on a set of generated data. The experimental results show that the algo-rithm could solve the 3D container loading problems in online fashion and is competitive against other algorithms both in the terms of running time, space utilization and number of bins.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | 08 Information And Computing Sciences |
| Subjects: | T Technology > TC Hydraulic engineering. Ocean engineering T Technology > TJ Mechanical engineering and machinery |
| Divisions: | Maritime and Mechanical Engineering (merged with Engineering 10 Aug 20) |
| Publisher: | Springer Verlag |
| Date of acceptance: | 12 January 2017 |
| Date of first compliant Open Access: | 17 January 2017 |
| Date Deposited: | 17 Jan 2017 11:56 |
| Last Modified: | 04 Sep 2021 12:05 |
| URI: | https://researchonline.ljmu.ac.uk/id/eprint/5275 |
![]() |
View Item |
Export Citation
Export Citation