Abstract
3D bin packing is a classical NP-hard (Nondeterministic Polynomial-time hard) problem where a set N of 3D boxes is to be packed in a minimum number of containers (bins). 3D bin packing is used in many industrial applications; hence computer scientists are challenged in designing practical and efficient approaches for the problem. This paper presents a new heuristic algorithm called Peak Filling Slice Push (PFSP) for 3D bin packing. The algorithm recursively divides the container into smaller slices and then fills each slice with boxes before pushing them to minimize the wasted space. Experimental results showed significant performance improvements over other current approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Haromkovic,Algorithmics for Hard Problems, 2nd ed., 2003.
K. Kleinberg and E. Tardos,Algorithm Design, Addison Wesley, 2006.
E.D. Boef, J. Korst, S. Martello, D. Pisinger, and D. Vigo, “A Note on Robot-Packable and Orthogonal variants of the Three-Dimensional Bin Packing Problem.”
S. Sweep, “Three Dimensional Bin-Packing Issues and Solutions,” University of Minnesota, 2003.
S. Wang, Singing voice: bright timbre, singer’s formant, and larynx positions, in A. Askenfelt, S. Felicetti, E. Jansson, and J. Sundberg, eds. Proc of Stockholm Music Acoustics Conference 1983 (SMAC 83). Stockholm: Publications issued by the Royal Swedish Academy of Music 46:1, 313-322.
M. Adamowicz, and A. Albano,Nesting Two-Dimensional Shapes in Rectangular Modules, Computer Aided Design, vol. 8, 1976, pp 27-33.
S. Israni, and J.L. Sanders, “Performance Testing of Rectangular Parts-Nesting Heuristics,”International Journal of Production Research,vol. 23, 1985, pp 437-456.
H. Gehring, K. Menschner, and M. Meyer, “A Computer-Based Heuristic for Packing Pooled Shipment Containers,”European Journal of Operational Research,vol. 44 (2), 1990, pp 277- 289.
Z. Dai, and J. Cha, “A Hybrid Approach of Heuristic and Neural Network for Packing Problems,”Advances in Design Automation 1994: Proceedings of the 20th ASME Design Automation Conference,vol. 2, 1994, pp 117-123.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this paper
Cite this paper
Maarouf, W.F., Barbar, A.M., Owayjan, M.J. (2008). A New Heuristic Algorithm for the 3D Bin Packing Problem. In: Elleithy, K. (eds) Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8735-6_64
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8735-6_64
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8734-9
Online ISBN: 978-1-4020-8735-6
eBook Packages: Computer ScienceComputer Science (R0)