Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Computers and Operations Research
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters
| Hi-index | 0.01 |
The problem of packing two-dimensional items into two-dimensional bins is considered in which patterns of items allocated to bins must be guillotine-cuttable and item rotation might be allowed (2BP|@?|G). Three new constructive heuristics, namely, first-fit insertion heuristic, best-fit insertion heuristic, and critical-fit insertion heuristic, and a new justification improvement heuristic are proposed. All new heuristics use tree structures to represent guillotine-cuttable patterns of items and proceed by inserting one item at a time in a partial solution. Central to all heuristics are a new procedure for enumerating possible insertions and a new fitness criterion for choosing the best insertion. All new heuristics have quadratic worst-case computational complexity except for the critical-fit insertion heuristic which has a cubic worst-case computational complexity. The efficiency and effectiveness of the proposed heuristics is demonstrated by comparing their empirical performance on a standard benchmark data set against other published approaches.