The Three-Dimensional Bin Packing Problem
Operations Research
The harpy speech recognition system.
The harpy speech recognition system.
Parallelism versus memory allocation in pipelined router forwarding engines
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A General Purpose Algorithm for Three-Dimensional Packing
INFORMS Journal on Computing
Computers and Operations Research
| Hi-index | 0.00 |
Packing problems deal with loading of a set of items (objects) into a set of boxes (containers) in order to optimize a performance criterion under various constraints. With the advance of RFID technologies and investments in IT infrastructures companies now have access to the necessary data that can be utilized in cost reduction of packing processes. Therefore bin packing and container loading problems are becoming more popular in recent years. In this research we propose a beam search algorithm to solve a packing problem that we encountered in a real world project. The 3D-MBSBPP (Multiple Bin Sized Bin Packing Problem) that we present and solve has not been analyzed in literature before, to the best of our knowledge. We present the performance of our proposed beam search algorithm in terms of both cost and computational time in comparison to a greedy algorithm and a tree search enumeration algorithm.