A column generation-based heuristic for the three-dimensional bin packing problem with rotation

Batoul Mahvash, Anjali Awasthi and Satyaveer Chauhan

Journal of the Operational Research Society, 2018, vol. 69, issue 1, 78-90

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.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1057/s41274-017-0186-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:69:y:2018:i:1:p:78-90

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1057/s41274-017-0186-7

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().