A New Heuristic Algorithm for the 3D Bin Packing Problem
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.
KeywordsHeuristic Algorithm Packing Problem Significant Performance Improvement Sorting Time Bunch Number
Unable to display preview. Download preview PDF.
- J. Haromkovic,Algorithmics for Hard Problems, 2nd ed., 2003.Google Scholar
- K. Kleinberg and E. Tardos,Algorithm Design, Addison Wesley, 2006.Google Scholar
- 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.”Google Scholar
- S. Sweep, “Three Dimensional Bin-Packing Issues and Solutions,” University of Minnesota, 2003.Google Scholar
- 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. Google Scholar
- 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.Google Scholar