A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
3-D Container Packing Heuristics
Applied Intelligence
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
A Tree Search Algorithm for Solving the Container Loading Problem
INFORMS Journal on Computing
An efficient placement heuristic for three-dimensional rectangular packing
Computers and Operations Research
| Hi-index | 0.01 |
This paper presents an efficient heuristic block-loading algorithm based on multi-layer search for the three-dimensional container loading problem. First, a basic heuristic block-loading algorithm is introduced. This algorithm loads one block, determined by a block selecting algorithm, in one packing phase, according to a fixed strategy, until no blocks are available. Second, the concept of composite block is introduced, the difference between traditional block and composite block being that composite block can contain multiple types of boxes in one block under some restrictions. Third, based on the depth-first search algorithm, a multi-layer search algorithm is developed for determining the selected block in each packing phase, and making this result closer to the optimal solution. Computational results on a classic data set show that the proposed algorithm outperforms the best known algorithm in almost all the test data.