Using a co-operative co-evolutionary genetic algorithm to solve a three-dimensional container loading problem

2002 ◽  
Author(s):  
C. Pimpawat ◽  
N. Chaiyaratana
Keyword(s):  
Genetic Algorithm ◽  
Three Dimensional ◽  
Container Loading ◽  
Evolutionary Genetic ◽  
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.

A Genetic Algorithm Approach to the Automated System for Solving the Container Loading Problem

2016 ◽  
pp. 267-280
Author(s):  
Rodrigo Nogueira Cardoso ◽  
Marco Vinícius Muniz Ferreira ◽  
Alexandre Rodrigues de Sousa ◽  
José Jean-Paul Zanlucchi Souza Tavares
Keyword(s):  
Genetic Algorithm ◽  
Automated System ◽  
Container Loading ◽  
Genetic Algorithm Approach ◽  
Loading Problem ◽  
Container Loading Problem

scholarly journals Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Xianbo Xiang ◽  
Caoyang Yu ◽  
He Xu ◽  
Stuart X. Zhu
Keyword(s):  
Genetic Algorithm ◽  
Test Data ◽  
Heterogeneous Data ◽  
Adaptive Genetic Algorithm ◽  
Space Utilization ◽  
Container Loading ◽  
Related Literature ◽  
3D Space ◽  
Loading Problem ◽  
Container Loading Problem

This paper studies an optimized container loading problem with the goal of maximizing the 3D space utilization. Based on the characteristics of the mathematical loading model, we develop a dedicated placement heuristic integrated with a novel dynamic space division method, which enables the design of the adaptive genetic algorithm in order to maximize the loading space utilization. We use both weakly and strongly heterogeneous loading data to test the proposed algorithm. By choosing 15 classic sets of test data given by Loh and Nee as weakly heterogeneous data, the average space utilization of our algorithm reaching 70.62% outperforms those of 13 algorithms from the related literature. Taking a set of test data given by George and Robinson as strongly heterogeneous data, the space utilization in this paper can be improved by 4.42% in comparison with their heuristic algorithm.

Sign in / Sign up

Export Citation Format

Share Document