A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint

Chen, Huan; Ye, Furong; Si, Yain-Whar

doi:10.1051/matecconf/20166806001

Cited by 2 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this method had no advantage for mixed packing of multiple irregularities. ere are some strip packing algorithms, heuristic algorithms, hybrid algorithms, three-dimensional packing algorithms, and some applications of these algorithms [17][18][19][20][21][22][23][24][25]. But some are only suitable for rectangular packing, and the calculation is complicated, which will be improved in this paper.…”

Section: Introductionmentioning

confidence: 99%

Descending Packing Algorithm for Irregular Graphics Based on Geometric Feature Points

Zheng

Lou

Da-jun

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The packing for two-dimensional irregular graphics is one of the NP-complete problems and widely used in industrial applications. In this paper, a descending nesting algorithm for a two-dimensional irregular graph based on geometric feature points is proposed. Before the packing, the parts to be packed are sorted, matched, and spliced, and the matching of the rectangular pieces and the rectangular-like pieces is carried out according to the plate size. On this basis, the geometric feature points of the parts are used to construct the packing baseline, and the packing is accurately carried out according to the principles of the bottom left, the principle of the lowest center of gravity, and combination with virtual moving, rotating collision calculation. The computation of the moving collision distance between the graphics is replaced by the projecting computation of the geometric feature points of the graphic parts, so the computation amount can be reduced. Also, this method is used to test a number of benchmarks examples which are provided by ESICUP (EURO Special Interest Group on Cutting and Packing), which show that the proposed algorithm not only can improve packing but also has better stability and reliability.

show abstract