This paper reviews the most relevant literature on efficient models and methods for packing
circular objects/items into Euclidean plane regions where the objects/items and regions are …

Abstract Currently, Offshore Wind Farms (OWFs) are designed to achieve high turbine
density so as to reduce costs. However, due to wake interferences, densely packing turbines …

A (general) circle packing is an optimized arrangement of N arbitrary sized circles inside a
container (eg, a rectangle or a circle) such that no two circles overlap. In this paper, we …

We introduce a new bin packing problem, termed the circle bin packing problem with circular
items (CBPP-CI). The problem involves packing all the circular items into multiple identical …

In this paper, we study the problem of packing unequal circles into a two-dimensional
rectangular container. We solve this problem by proposing two greedy algorithms. The first …

In this paper, we study the problem of cutting a rectangular plate R of dimensions (L, W) into
as many circular pieces as possible. The circular pieces are of n different types with radii ri …

In this paper, we propose to solve the circular packing problem (CPP) whose objective is to
pack n different circles Ci of known radius ri, i∈ N={1,…, n}, into the smallest containing …

This study proposes a simulated annealing with restart strategy (SA_RS) heuristic for the
multiconstraint team orienteering problem with multiple time windows (MC-TOP-MTW), an …

In this paper we present a heuristic algorithm for the problem of packing unequal circles in a
fixed size container such as the unit circle, the unit square or a rectangle. We view the …

The paper considers a problem of packing unequal circles into a rectangular strip with fixed
width and minimal length. We develop the idea of increasing the dimension of the solution …