A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
A GRASP Approach to the Container-Loading Problem
IEEE Intelligent Systems
A new heuristic algorithm for cuboids packing with no orientation constraints
Computers and Operations Research
A Maximal-Space Algorithm for the Container Loading Problem
INFORMS Journal on Computing
Neighborhood structures for the container loading problem: a VNS implementation
Journal of Heuristics
An efficient deterministic heuristic for two-dimensional rectangular packing
Computers and Operations Research
A heuristic block-loading algorithm based on multi-layer search for the container loading problem
Computers and Operations Research
Data Structures for Higher-Dimensional Rectilinear Packing
INFORMS Journal on Computing
A beam search approach to the container loading problem
Computers and Operations Research
Hi-index | 0.01 |
By embodying the spirit of ''gold corner, silver side and strawy void'' directly on the candidate packing place such that the searching space is reduced considerably, and by utilizing the characteristic of weakly heterogeneous problems that many items are in the same size, a fit degree algorithm (FDA) is proposed for solving a classical 3D rectangular packing problem, container loading problem. Experiments show that FDA works well on the complete set of 1500 instances proposed by Bischoff, Ratcliff and Davies. Especially for the 800 difficult strongly heterogeneous instances among them, FDA outperforms other algorithms with an average volume utilization of 91.91%, which to our knowledge is 0.45% higher than current best result just reported in 2010.