Now showing items 1-5 of 5
μθ-EGF : a new multi-thread and nature-inspired algorithm for the packing problem
In this paper, the authors present a new algorithm efficient solution to the packing problem in two dimensions. The authors propose a new heuristic using the value of the electromagnetic field to determine the best position ...
Monkey algorithm for packing circles with binary variables
(Springer Verlag, 2019)
The problem of packing non-congruent circles within a rectangular container is considered. The objective is to place the maximum number of circles inside the container such that no circle overlaps with another one. This ...
A new heuristic algorithm to solve circle packing problem inspired by nanoscale electromagnetic fields and gravitational effects
(Institute of Electrical and Electronics Engineers Inc., 2019)
In this paper, we present a new algorithm for the fast and efficient solution of the Packing problem in two dimensions. The packing problem consists in finding the best arrangement of objects (many geometrical forms) in a ...
Optimized filling of a given cuboid with spherical powders for additive manufacturing
(Operations Research Society of China, 2020-08-11)
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 including metal powders. In particular, ...
Optimized packing of object clusters with balancing conditions
(Springer Science and Business Media Deutschland GmbH, 2020-09-09)
Packing clusters composed of non-overlapping non-identical convex objects is considered. The packing problem, originally stated in Romanova et al. (Math Probl Eng 2019:Article ID 4136430, 12 pages, 2019), is extended here ...