An algorithm for polygon placement using a bottom-left strategy

Dowsland, Kathryn A.; Vaid, Subodh; Dowsland, William B.

doi:10.1016/s0377-2217(02)00131-5

Cited by 105 publications

(75 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The no-fit polygon gives the set of non-overlapping placements for a given pair of polygons. Good examples of this type of procedure that work well for the strip packing problem are described by Hu-yao and Yuan-jun (2006), Gomes and Oliveira (2002), Dowsland et al (2002), Burke and Kendall (1999b), Burke et al (2007). While the no-fit polygon is a powerful geometric technique, there are several issues that limit its scalability for industrial applications.…”

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

“…Okano (2002) obtains an ordering of pieces with respect to their areas and the similarities among them. Dowsland et al (2002) use eight static orderings, which have the common strategy of trying to place the difficult-to-place pieces first. Dynamic selection permits all pieces to be available to be placed next Bennell and Oliveira (2009), for example, Bennell and Song (2010) use beam search.…”

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

“…The heuristic does not allow a piece to skip around another placed piece. The performance of this heuristic greatly depends on the initial ordering of the pieces (Dowsland et al 1998(Dowsland et al , 2002. Its advantage lies in its speed and simplicity.…”

Section: The Placement Heuristicsmentioning

confidence: 99%

See 2 more Smart Citations

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

et al. 2013

View full text Add to dashboard Cite

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.

show abstract

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Lee et al [4] used direct trigonometry to determine the interference among items and the container. Recently, the nofit polygon (NFP) has been used by several researchers [5][6][7][8][9] to ensure feasible layouts.…”

Section: E-mail Address: Mtsuzuki@uspbr (Msg Tsuzuki)mentioning

confidence: 99%

“…The inner fit polygon is another important frequently used concept, which is derived from the NFP and represents a set of translations for the placement of items inside a container C. The inner fit polygon can be computed by sliding an item along the internal contour of the container [5] (see Fig. 2).…”

Section: The Inner Fit Polygonmentioning

confidence: 99%