Abstract
The paper considers an optimization problem of packing different solid spheres into containers of the following types: a cuboid, a sphere, a right circular cylinder, an annular cylinder, and a spherical layer. The radii of spheres are assumed to vary. It allows us to propose a new way to derive starting points belonging to the feasible domain of the problem, as well as to carry out a non-exhaustive search of local extrema, using a modification of the jump algorithm (JA), which implements a continuous transition from one local minimum to another with a better value of the objective function. A reduction of the solution space dimension and rearrangements of sphere pairs allow improving the objective function value. The results obtained are compared with benchmark ones.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call