Paper Info
Title
A column generation-based heuristic for the three-dimensional bin packing problem with rotation.
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.
Year
DOI
Venue
2018
10.1057/s41274-017-0186-7
JORS
Keywords
Field
DocType
three-dimensional bin packing problem (3D-BPP), rotation constraints, city logistics, column generation, heuristics
Extreme point,Heuristic,Column generation,Mathematical optimization,Reduced cost,Atomic packing factor,Computer science,City logistics,Heuristics,Operations management,Bin packing problem
Journal
Volume
Issue
ISSN
69
1
1476-9360
Citations 
PageRank 
References 
0
0.34
30
Authors
3
Name
Order
Citations
PageRank
Batoul Mahvash110.69
Anjali Awasthi21307.92
Satyaveer Singh Chauhan3456.57