A Look-Forward Heuristic for Packing Spheres into a Three-Dimensional Bin
Hakim Akeb
DOI: http://dx.doi.org/10.15439/2014F145
Citation: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 2, pages 397–404 (2014)
Abstract. In this paper, a look-forward heuristic is proposed in order to solve the problem of packing spheres into a three-dimensional bin of fixed height and depth but variable length. The objective is to pack all the spheres into the bin of minimum length. This problem is also known under the name of the three-dimensional strip packing problem. The computational investigation, conducted on a set of benchmark instances taken from the literature, shows that the method is effective since it improves most of the best known results.