Greedy algorithms for packing unequal circles into a rectangular container

Huang, Wenqi; Li, Y; Akeb, Hakim; Li, C M

doi:10.1057/palgrave.jors.2601836

Cited by 97 publications

(85 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…called further candidate domain) defined by the rectangular cells of E 1 and E 3 (two small rectangles in Fig.7). Fig.7 shows the case when the ellipse E 4 is not tested for placing E 3 since it does not intersect the candidate domain, the ellipse E 2 overlaps with the candidate domain and, hence, can be considered for placing E 3 .…”

Section: Composed Of the Particles E I For Whichmentioning

confidence: 99%

See 1 more Smart Citation

A new algorithm for dense ellipse packing and polygonal structures generation in context of FEM or DEM

Ilin

Bernacki

2016

MATEC Web Conf.

View full text Add to dashboard Cite

Abstract.A new constructive ellipse packing algorithm is presented. It allows to respect the imposed area, shape and spatial orientation distribution (i.e. the inertia tensor) and achieve high packing densities. The packing density decreases with increasing particles aspect ratio what is in agreement with results reported in the literature. The generated packings with complex imposed area, shape and spatial orientation distributions with densities in the range of 0.74 and 0.8 are presented. The efficiency of the algorithm is demonstrated by comparison with the Optimized Dropping and Rolling method for disk packing. Moreover, the proposed packing strategy enables to generate very easily non-equiaxed polygonal structures by using Laguerre-Voronoï tessellation of the generated disk-based ellipse packing.

show abstract

Section: Composed Of the Particles E I For Whichmentioning

confidence: 99%

“…Most studies were carried out for the packing of uniform and arbitrary sized spheres [1], considering the problem of optimal packing [2][3][4][5], (and its dual, the sphere cutting problem [6,7]) or space-filling [8][9][10][11][12][13][14].…”

mentioning

confidence: 99%

A new algorithm for dense ellipse packing and polygonal structures generation in context of FEM or DEM

Ilin

Bernacki

2016

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…This is in fact the adaptation of the Maximum Hole Degree (MHD) heuristic [4], designed for packing circles, to the threedimensional case.…”

Section: The 3dmhd Heuristic For Packing Spheres Into a Three-dimentioning

confidence: 99%

A Look-Forward Heuristic for Packing Spheres into a Three-Dimensional Bin

Akeb¹

2014

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-In this paper a look-forward heuristic is proposed in order to solve the problem of packing spheres into a threedimensional bin of fixed height and depth but variable length. The objective is to pack all the spheres into the bin of minimum length. This problem is also known under the name of threedimensional strip packing problem. The computational investigation, conducted on a set of benchmark instances taken from the literature, shows that the method is effective since it improves most of the best known results.

show abstract

“…Human experiences in packing show that the placements of a circle at some particular positions, like corner regions formed by the container and circles already placed, are worth to be examined to generate a successful configuration [11]. The notion corner placement in our approach is inspired from these experiences, which refers to placing a circle at a corner region formed by the container and circles already placed, so that the circle touches at least two circles.…”

Section: Corner Placementmentioning

confidence: 99%

“…A preliminary version of this work appeared in [12,13], and then extended to solve the problem of packing unequal circles into a rectangular container [11]. The basic idea of our approach is a quantified measure, called hole degree, to evaluate the benefit of placing a circle in the container, which gives the first algorithm, denoted by A1.0.…”

Section: Introductionmentioning

confidence: 99%

New heuristics for packing unequal circles into a circular container

Huang

Liu

et al. 2006

Computers & Operations Research

View full text Add to dashboard Cite

We propose two new heuristics to pack unequal circles into a two dimensional circular container. The first one, denoted by A1.0, is a basic heurisitc which selects the next circle to place according to the maximal hole degree rule. The second one, denoted by A1.5, uses a self lookahead strategy to improve A1.0. We evaluate A1.0 and A1.5 on a series of instances up to 100 circles from the literature and compare them with existing approaches. We also study the behaviour of our approach for packing equal circles comparing with a specified approach in the literature. Experimental results show that our approach has a good performance in terms of solution quality and computational time for packing unequal circles.

show abstract

Greedy algorithms for packing unequal circles into a rectangular container

Cited by 97 publications

References 7 publications

A new algorithm for dense ellipse packing and polygonal structures generation in context of FEM or DEM

A new algorithm for dense ellipse packing and polygonal structures generation in context of FEM or DEM

A Look-Forward Heuristic for Packing Spheres into a Three-Dimensional Bin

New heuristics for packing unequal circles into a circular container

Contact Info

Product

Resources

About