A beam search approach to solve the convex irregular bin packing problem with guillotine cuts

Abstract

This paper presents a two dimensional convex irregular bin packing problem with guillotine cuts. The problem combines the challenges of tackling the complexity of packing irregular pieces, guaranteeing guillotine cuts that are not always orthogonal to the edges of the bin, and allocating pieces to bins that are not necessarily of the same size. This problem is known as a two-dimensional multi bin size bin packing problem with convexirregular pieces and guillotine cuts. Since pieces are separated by means of guillotine cuts, our study is restricted to convex pieces. A beam search algorithm is described, which is successfully applied to both the multi and single bin size instances. The algorithm is competitive with the results reported in the literature for the single bin size problem and provides the first results for the multi bin size problem.

A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

“…Abeysooriya et al (2018) also allowed items to rotate freely and then developed a singlepass constructive algorithm that uses a Jostly procedure to take placement and allocation decisions together. In Bennell et al (2018), guillotine cuts are imposed, and bins have different sizes. The authors presented a beam search algorithm that uses a tree search and evaluates only promising nodes.…”

“…In Bennell et al. (2018), guillotine cuts are imposed, and bins have different sizes. The authors presented a beam search algorithm that uses a tree search and evaluates only promising nodes.…”