An effective heuristic for the two-dimensional irregular bin packing problem

Abstract

This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin packing problem. In the two-dimensional case, not only is it the case that the piece's size is important but its shape also has a significant influence. Therefore, DJD as a selection heuristic has to be paired with a placement heuristic to completely construct a solution to the underlying packing problem. A successful adaptation of the DJD requires a routine to reduce computational costs, which is also proposed and successfully tested in this paper. Results, on a wide variety of instance types with convex polygons, are found to be significantly better than those produced by more conventional selection heuristics.

Solving Non-standard Packing Problems by Global Optimization and Heuristics

“…Allen et al 2011;Bennell et al 2013;Bennel et al 2013;Bennell and Oliveira 2009;Bortfeldt and Gehring 2001;Bortfeldt et al 2003;Burke et al 2006Burke et al , 2010Coffman et al 1997;Dowsland et al 2006;Gehring and Bortfeldt 2002;Gomes and Olivera 2002;Gonçalves and Resende 2012;Turton 2001, 2002;López-Camacho et al 2013;Mack et al 2004;Oliveira et al 2000;Pisinger 2002;Ramakrishnan et al 2013;Terashima-Marín et al 2010;Wang et al 2008;Yeung and Tang 2005). Nonetheless, modelling-based approaches have also been investigated (e.g.…”

Heuristics for the combined cut order planning two‐dimensional layout problem in the apparel industry

“…; Chernov et al., ; Gomes and Oliveira, ; ; Costa et al., ). The ordered set of pieces is a fixed sequence obtained via a rule of thumb (Dowsland et al., ), or via a classifier system (Terashima‐Marin et al., ; Lopez‐Camacho et al., ), or via a local search over possible permutations using a metaheuristic such as hill climbing, tabu search, SA, GA, beam search, etc. (Bortfeldt, ; Terashima‐Marin et al., ; Yeung and Tang, ), or via complete enumeration (Cui et al., ; Lesh et al., ; Toledo et al., ).…”

Transferring object allocation model over time

“…For example, Del Valle et al (2012) has developed a heuristic for 0/1 version of the Knapsack Problem. López-Camacho et al (2013) applied the Djang and Finch heuristic (DJD) method to two-dimensional packing problem which was originally designed for one-dimensional packing problem. Lam, Sze, and Tan (2007) developed a method for practical use in the metal sheet cutting industry.…”