A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts

A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts ( 2 DBP | ⁎ | 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 autho...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2011-10, Vol.38 (10), p.1443-1451
Main Authors: Charalambous, Christoforos, Fleszar, Krzysztof
Format: Article
Language:English
Subjects:
Applied sciences
Construction
Constructive heuristic
Exact sciences and technology
Flows in networks. Combinatorial problems
Guillotine cut
Guillotines
Heuristic
Heuristic methods
Operational research and scientific management
Operational research. Management science
Operations research
Optimization algorithms
Packing problem
Studies
Two dimensional
Two-dimensional bin packing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new heuristic algorithm for solving the two-dimensional bin-packing problem with guillotine cuts ( 2 DBP | ⁎ | 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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2010.12.013