A Hybrid Greedy Algorithm and Simulated Annealing for Single Container Loading Problem: A Case Study

Authors

  • Gede A Widyadana Petra Christian University
  • Audrey Tedja Widjaja School of Management, Industrial Management Department, National Taiwan University of Science and Technology, 43, Sec.4, Keelung Road, Taipei 106, Taiwan, ROC
  • Kun Jen Wang School of Management, Industrial Management Department, National Taiwan University of Science and Technology, 43, Sec.4, Keelung Road, Taipei 106, Taiwan, ROC

:

https://doi.org/10.9744/jti.20.2.89-94

Keywords:

single container loading problem, greedy algorithm, simulated annealing

Abstract

A single container loading problem is a problem to effectively load boxes in a three-dimensional container. There are many researchers in this problem try to find the best solution to solve the problem with feasible computation time and to develop some models to solve real case problem. Heuristics are the most method used to solve this problem since the problem is an NP-hard. In this paper, we introduce a hybrid greedy algorithm and simulate annealing algorithm to solve a real container loading problem in one flexible packaging company in Indonesia. Validation is used to show that the method can be applied practically. We use seven real cases to check the validity and performance of the model. The proposed method outperformed the solution developed by the company in all seven cases with feasible computational time.

References

Bortfeldt A., and Wascher G. Constraints in Container :oading – A State-of-the-art Review, European Journal of Operational Research, 229, 2013, pp. 1-20.

Araya I., and Riff M.C., A Beam Search Approach to the Container Loading Problem, Computers & Operations Research, 43, 2014, pp. 100-107.

Zhu W, Lim A, A New Iterative-doubling Greedy-look Ahead Algorithm for the Single Container Loading Problem, European Journal of Operatio-nal Research, 222 (3), 2012, pp.408–417.

Zhu W, Hon W, Lim A, and Weng Y. The Six Elements to Block-building Approaches for the Single Container Loading Problem, Applied Intelligence, 37(3), 2012, pp. 1–15.

Gonçalves J, and Resende M, A Parallel Multi-population Genetic Algorithm for a Constrained Two-dimensional Orthogonal Packing Problem, Journal of Combinatorial Optimization, 22(2), 2011, pp. 180–201.

Fanslau T, and Bortfeldt A, A Tree Search Algorithm for Solving the Container Loading Problem, INFORMS Journal on Computing, 22(2), 2010, pp.22–35.

Lim A., Ma H., Qiu C., and Zhu W., The Single Container Loading Problem with Axle Weight Constraints, International Journal of Production Economics, 144, 2013, pp. 358-369.

Wang N., Lim A., and Zhu W., A Multi-round Partial Beam Search Approach for the Single Container Loading Problem with Shipment Priority, International Journal of Production Economics, 145, 2013, pp. 531-540.

Huang W., and He K., A Caving Degree Approach for the Single Container Loading, European Journal of Operational Research, 196, 2009, pp. 93-101.

Liu J., Yue Y., Donng Z., Maple C., and dam Keech M., A Novel Hybrid Tabu Search to Container Loading, 38, 2011, pp. 797-807.

Chen, C., Lee, S., and Shen, Q. An Analytical Model for the Container Loading Problem, European Journal of Operational Research, 80(1), 1995, pp. 68-76.

Downloads

Published

2019-01-12

How to Cite

[1]
G. A. Widyadana, A. T. Widjaja, and K. J. Wang, “A Hybrid Greedy Algorithm and Simulated Annealing for Single Container Loading Problem: A Case Study”, Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri, vol. 20, no. 2, pp. 89-94, Jan. 2019.

Issue

Vol. 20 No. 2 (2018): December 2018

Section

Articles

License

Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).


This work is licensed under a  Creative Commons Attribution License (CC BY).