Abstract
This paper addresses a three-dimensional bin packing problem (3D-BPP) with rotation. The aim is finding the best way of packing 3D items into bins to increase the packing factor with the purpose of minimizing the number of bins. No restrictions apply to the orientation of the items, in which case items can be rotated both vertically and horizontally. 3D-BPP is solved by using a column generation (CG) technique-based heuristic. To generate new columns, fast CG is carried out by applying a heuristic pricing method, in which items with most negative reduced cost are sequentially positioned into bins based on an extreme point concept. The CG technique outperforms the best significant techniques in the literature in terms of solution quality. We also provide the new lower bounds for 3D-BPP with no rotation using CG technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
