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 …

The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …

We address a new packing problem variant known as the 2D circle bin packing problem (2D-
CBPP), which involves packing circles into multiple square bins as densely as possible so …

In additive manufacturing (also known as 3D printing), a layer-by-layer buildup process is
used for manufacturing parts. Modern laser 3D printers can work with various materials …

In this paper an optimized multidimensional hyperspheres packing problem (HPP) is
considered for a bounded container. Additional constraints, such as prohibited zones in the …

In this paper, we study the three-dimensional sphere packing which consists in finding the
greatest density of a (sub) set of predefined spheres (small items) into a three-dimensional …

A set of circles, rectangles, and convex polygons are to be cut from rectangular design
plates to be produced, or from a set of stocked rectangles of known geometric dimensions …

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 heuristic which selects the next circle to …

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 paper presents an Iterated Tabu Search and Variable Neighborhood Descent (ITS-
VND) algorithm for packing unequal circles into a circular container (PUCC). The algorithm …