On solving logistics problems using the methods of the theory of optimal set partitioning
DOI:
https://doi.org/10.34185/1562-9945-2-163-2026-07Keywords:
optimal partitioning, logistics problems, dynamic models, spatial zoning, resource allocation, numerical modelingAbstract
The paper presents an approach to solving a broad class of logistics problems based on the methods of the theory of optimal set partitioning. In particular, a mathematical for-malization is proposed for problems related to spatial allocation of objects, route opt-imization, territory zoning, and resource distribution, formulated as optimal set partitioning problems according to predefined efficiency criteria. The main focus is on the dynamic asp-ects of the problem formulation, which involve time-varying input data as well as stochastic components and uncertainty. Algorithmic approaches to solving such problems are outlined, including the use of modified heuristic and metaheuristic methods, as well as elements of machine learning for forecasting changes in system parameters. The obtained results can be used to improve the efficiency of decision-making in logistics, urban planning, and other app-lied fields where it is essential to consider both spatial structure and dynamic changes.
References
Fisher M. L. Optimal Solution of Set Covering/Partitioning Problems Using Lagrangian Relaxation. Management Science, 1990, vol. 36, no. 6, pp. 674–688. DOI: 10.1287/mnsc.36.6.674
Kiseleva E. M., Shor N. Z. Continuous Problems of Optimal Partitioning of Sets: Theory, Algorithms, Applications. Kyiv: Naukova Dumka, 2005. – 564 p.
Kiseleva E. M., Prytomanova O. M., Hart L. L. Solving a Two-Stage Continuous-Discrete Problem of Optimal Partitioning-Allocation with Subsets Centers Placement. Open Computer Science, 2020, vol. 10, pp. 124–136. DOI: 10.1515/comp-2020-0142. ISSN 2312-119X.
Kiseleva E. M., Prytomanova O. M., Hart L. L. Algorithm for Constructing Voronoi Dia-grams with Optimal Placement of Generator Points Based on Theory of Optimal Set Partition-ing. Journal of Automation and Information Sciences, 2020, vol. 52, no. 3, pp. 1–12.
Lin J., Zhang X., Li Z. Optimal Unlabeled Set Partitioning with Application to Risk As-sessment. Journal of Risk and Financial Management, 2024, vol. 17, no. 1, p. 25. DOI: 10.3390/jrfm17010025
Samer P., Cavalcante E., Urrutia S., Oppen J. The Matching Relaxation for a Class of Gen-eralized Set Partitioning Problems. Computers & Operations Research, 2017, vol. 85, pp. 116–131. DOI: 10.1016/j.cor.2017.03.010
Pintér J. Set Partition by Globally Optimized Cluster Seed Points. European Journal of Op-erational Research, 2000, vol. 125, no. 1, pp. 243–246. DOI: 10.1016/S0377-2217(99)00423-2
Fekete S. P., Koehler E., Teich J. Higher-Dimensional Packing with Order Constraints. Discrete Applied Mathematics, 2003, vol. 132, no. 1–3, pp. 67–85. DOI: 10.1016/S0166-218X(02)00323-4
Mallozzi L., Puerto J., Rodríguez-Madrena M. On Location-Allocation Problems for Di-mensional Facilities. European Journal of Operational Research, 2020, vol. 281, no. 2, pp. 443–459. DOI: 10.1016/j.ejor.2019.07.038
Ahuja R. K., Magnanti T. L., Orlin J. B. Network Flows: Theory, Algorithms, and Appli-cations. Prentice Hall, 2005. – 1020 p.
Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. Wiley-Interscience, 2009. – 768 p.
Dantzig G.B., Thapa M. N. Linear Programming 1: Introduction. Springer, 2006. – 448 p.
Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2022. Available at: https://www.gurobi.com
Burke E.K., Kendall G., editors. Search Methodologies: Introductory Tutorials in Optimi-zation and Decision Support Techniques. Springer, 2014. – 324 p.
Hwang F.K., Richards D.S., Winter P. The Steiner Tree Problem. Elsevier, 2013. – 392 p.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 System technologies
This work is licensed under a Creative Commons Attribution 4.0 International License.
