Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A recursive computational procedure for container loading
Proceedings of the 23rd international conference on on Computers and industrial engineering
Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp
Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp
The Three-Dimensional Bin Packing Problem
Operations Research
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
Incremental Move for 2D Strip-Packing
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
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
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
The single container loading problem is a three-dimensional packing problem in which a container has to be filled with a set of boxes. The objective is to maximize the space utilization of the container. This problem has wide applications in the logistics industry. In this work, a new constructive approach to this problem is introduced. The approach uses a beam search strategy. This strategy can be viewed as a variant of the branch-and-bound search that only expands the most promising nodes at each level of the search tree. The approach is compared with state-of-the-art algorithms using 16 well-known sets of benchmark instances. Results show that the new approach outperforms all the others for each set of instances.