Hybridization and the Collaborative Combination of Algorithms: Case Study: The Container Loading Problem

2014 ◽  
Author(s):  
Ayodeji Remi Omosowon ◽  
Richard Cant ◽  
Caroline Langensiepen
Keyword(s):  
Container Loading ◽  
Loading Problem ◽  
Container Loading Problem

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

2019 ◽  
Vol 20 (2) ◽  
pp. 89
Author(s):  
Gede A Widyadana ◽  
Audrey Tedja Widjaja ◽  
Kun Jen Wang
Keyword(s):  
Greedy Algorithm ◽  
Three Dimensional ◽  
Computation Time ◽  
Computational Time ◽  
Container Loading ◽  
Flexible Packaging ◽  
Loading Problem ◽  
And Performance ◽  
Container Loading Problem

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.

scholarly journals A GRASP Approach to the Container-Loading Problem

2005 ◽  
Vol 20 (4) ◽  
pp. 50-57 ◽  
Author(s):  
A. Moura ◽  
J.F. Oliveira
Keyword(s):  
Container Loading ◽  
Loading Problem ◽  
Container Loading Problem
Sign in / Sign up

Export Citation Format

Share Document