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

  • Authors:
  • Christoforos Charalambous;Krzysztof Fleszar

  • Affiliations:
  • Department of Computer Science and Engineering, Frederick University, P.O. Box 24729, 1303 Nicosia, Cyprus;Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.