Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cor.2013.09.003 | Computers & OR |
Keywords | DocType | Volume |
benchmark instance,three-dimensional packing problem,search tree,logistics industry,new approach,well-known set,branch-and-bound search,single container loading problem,new constructive approach,beam search strategy,beam search approach | Journal | 43, |
ISSN | Citations | PageRank |
0305-0548 | 11 | 0.51 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ignacio Araya | 1 | 104 | 12.29 |
| María Cristina Riff | 2 | 200 | 23.91 |