Abstract
The paper considers several methods of analyzing opportunities for optimizing supply chains. An iterative method of finding the optimal structure is proposed, considering the power of the supply chain links and the capacity of the paths between them. The theorem on the value of the maximum flow in the combined path is proved. A numerical simulation of the operation of the proposed algorithm for finding directions for the optimization of the network structure was performed.
Publisher
Taras Shevchenko National University of Kyiv
Reference10 articles.
1. 1. Godonoga A. F., Blanutsa S. A., Chumakov B.M. Algorithm for adjusting input and output flows in a production process. Theory of Optimal Solutions. 2005. No 18. P. 34-39.
2. 2. Symonov D. I. Algorithm for determining the optimal flow in Supply Chains, considering multi-criteria conditions and stochastic processes. Bulletin of Taras Shevchenko National University of Kyiv. Physics and Mathematics. 2021. No 2. P. 109-116. https://doi.org/10.17721/1812-5409.2021/2.15
3. 3. Stetsyuk P. I., Bysaha O. P., Tregubenko S. S. Two-stage transportation problem with constraint on the number of intermediate locations. Computer Mathematics. 2018. No 2. P. 119-128.
4. 4. Zhang B., Peng J. Uncertain Graph and Network Optimization. Springer Singapore, 2022. P. 130. https://doi.org/10.1007/978-981-19-1472-05
5. 5. Gulyanytskyi L.F., Pavlenko A.I. Modeling time-dependent problems of finding optimal routes: an overview. Mathematical modeling in economics. 2017. No 1-2. P. 102-116.