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
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters
Computers and Operations Research
On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems
International Journal of Advanced Pervasive and Ubiquitous Computing
Novel Hybrid Genetic Approach for Two Dimensional Guillotinable Cutting Problems
International Journal of Advanced Pervasive and Ubiquitous Computing
Hi-index | 0.01 |
A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts (2DBP|@?|G) is presented. The heuristic constructs a solution by packing a bin at a time. Central to the adopted solution scheme is the principle of average-area sufficiency proposed by the authors for guiding selection of items to fill a bin. The algorithm is tested on a set of standard benchmark problem instances and compared with existing heuristics producing the best-known results. The results presented attest to the efficacy of the proposed scheme.