A Multi-Layer Heuristic Search Algorithm for Three Dimensional Container Loading Problem

2012 ◽  
Vol 35 (12) ◽  
pp. 2553 ◽  
Author(s):  
De-Fu ZHANG ◽  
Yu PENG ◽  
Li-Li ZHANG
2019 ◽  
Vol 20 (2) ◽  
pp. 89
Author(s):  
Gede A Widyadana ◽  
Audrey Tedja Widjaja ◽  
Kun Jen Wang

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.


2013 ◽  
Vol 278-280 ◽  
pp. 2289-2292
Author(s):  
Chun Yu Ren

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. According to the characteristics of model, improved Heuristic Search Algorithm is used to get the optimization solution. Firstly, on the basis of cubage-weight balance algorithm, construct initial solution to improve the feasibility. Secondly, adopt the operations of 1-exchange and 2-opt* to fasten the speed of convergence and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.


2020 ◽  
Vol 286 (2) ◽  
pp. 417-431
Author(s):  
Ignacio Araya ◽  
Mauricio Moyano ◽  
Cristobal Sanchez

2006 ◽  
Vol 40 (3) ◽  
pp. 342-350 ◽  
Author(s):  
Michel Gendreau ◽  
Manuel Iori ◽  
Gilbert Laporte ◽  
Silvano Martello

Sign in / Sign up

Export Citation Format

Share Document