An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet
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 known well in advance and they have to be packed in real-time when they arrive. 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 evaluated on a set of generated data. The experimental results show that the algorithm 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 the number of bins.
KeywordsDynamic optimization Online optimization Dynamic environments 3D bin packing problem 3D container loading problem Online packing heuristic Physical internet Benchmark problems
This work is supported by a Newton Institutional Links grant funded by the UK BEIS via the British Council, a Newton Research Collaborations Programme (3) grant funded by the UK BEIS via the Royal Academy of Engineering, and a Seed-corn project funded by the Chartered Institute of Logistics and Transport.
The authors thank anonymous reviews for their suggestions and contributions and corresponding editor for his/her valuable efforts.
- 1.Bui, L.T., Baker, S., Bender, A., Abbass, H.A., Barlow, M., Saker, R.: A grid-based heuristic for two-dimensional packing problems. In: 2011 IEEE Congress on Evolutionary Computation (CEC), pp. 2329–2336 (2011)Google Scholar
- 4.Scheithauer, G.: Algorithms for the container loading problem. In: Gaul, W., et al. (eds.) Operations Research Proceedings 1991, pp. 445–452. Springer, Heidelberg (1992)Google Scholar
- 9.Liu, D.S., Tan, K.C., Huang, S.Y., Goh, C.K., Ho, W.K.: On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur. J. Oper. Res. 190, 357–382 (2008)Google Scholar
- 11.ALICE, Global Supply Network Coordination and Collaboration research & innovation roadmap. ALICE - Alliance for Logistics Innovation through Collaboration in Europe (2014)Google Scholar
- 13.Berndt, S., Jansen, K., Klein, K.-M.: Fully dynamic bin packing revisited, arXiv preprint arXiv:1411.0960 (2014)
- 19.Martello, S., Pisinger, D., Vigo, D., Boef, E.D., Korst, J.: Algorithm 864: general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Softw. (TOMS) 33, 7 (2007)Google Scholar
- 27.Tiwari, S., Fadel, G., Fenyes, P.: A fast and efficient compact packing algorithm for free-form objects. In: ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, pp. 543–552 (2008)Google Scholar
- 28.Karabulut, K., İnceoğlu, M.M.: A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method. In: International Conference on Advances in Information Systems, pp. 441–450 (2004)Google Scholar
- 30.Wang, H., Chen, Y.: A hybrid genetic algorithm for 3d bin packing problems. In: 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), pp. 703–707 (2010)Google Scholar
- 31.Wang, R., Nguyen, T.T., Kavakeb, S., Yang, Z., Li, C.: Benchmarking Dynamic Three-Dimensional Bin Packing Problems Using Discrete-Event Simulation. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9598, pp. 266–279. Springer, Heidelberg (2016). doi: 10.1007/978-3-319-31153-1_18CrossRefGoogle Scholar