Algorithms for Optimal Arrangement of Differently Sized Logistics Objects on a Plane

Pavel D. Lebedev –N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences (Yekaterinburg, Russia), Alexander A. Uspenskii –N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences; Liberal Arts University – University for Humanities (Yekaterinburg, Russia).
Year: 2026
UDK: 339.18+519.866
Pages: 13–19
Language: russian
Section: Economics
Keywords: cost function, Euclidean distance, Hausdorff deviation, Chebyshev center
Abstract
The paper examines the problem of constructing an optimal arrangement of logistics centers on a flat domain. Minimizing the distance from an arbitrary point in the set to the nearest center is chosen as the optimality criterion. The authors propose algorithms based on partitioning the set into regions of influence of the centers. The study employs the Chebyshev center constructions.
License: