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

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)

Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri
Vol. 20 No. 2 (2018): December 2018

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.