Geodesic
Flows in strongly regular periodic dynamic resource networks
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 31 (2021) no. 3, pp. 458-470 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper is devoted to studying the processes of resource allocation in dynamic resource networks. In such networks, the capacities of the arcs depend on time. Resource allocation in the network occurs in discrete time. The resource of each vertex is distributed only between adjacent vertices according to some rules. The study of the processes of resource redistribution in such networks is carried out. The main goal is to develop methods for finding the limit state (distribution) of a resource in a dynamic resource network. It is shown that the approach based on the construction of an auxiliary network is also applicable to reduce the problem of resource allocation in a dynamic network to a similar problem in an auxiliary network. Theorems on the existence of a limit state on an auxiliary graph are proved for strongly regular periodic dynamical networks. To find the limit states, one can use the approaches which are developed for the shortest path problem in dynamic networks.
Keywords: resource network, dynamic networks, threshold value, process of resources allocation, limit state in resource network. 
@article{VUU_2021_31_3_a7,
     author = {V. A. Skorokhodov and D. O. Sviridkin},
     title = {Flows in strongly regular periodic dynamic resource networks},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {458--470},
     year = {2021},
     volume = {31},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2021_31_3_a7/}
}
TY  - JOUR
AU  - V. A. Skorokhodov
AU  - D. O. Sviridkin
TI  - Flows in strongly regular periodic dynamic resource networks
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2021
SP  - 458
EP  - 470
VL  - 31
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VUU_2021_31_3_a7/
LA  - ru
ID  - VUU_2021_31_3_a7
ER  - 
%0 Journal Article
%A V. A. Skorokhodov
%A D. O. Sviridkin
%T Flows in strongly regular periodic dynamic resource networks
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2021
%P 458-470
%V 31
%N 3
%U http://geodesic.mathdoc.fr/item/VUU_2021_31_3_a7/
%G ru
%F VUU_2021_31_3_a7
V. A. Skorokhodov; D. O. Sviridkin. Flows in strongly regular periodic dynamic resource networks. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 31 (2021) no. 3, pp. 458-470. http://geodesic.mathdoc.fr/item/VUU_2021_31_3_a7/

[1] Ford L. R., Fulkerson D. R., “Constructing maximal dynamic flows from static flows”, Operations Research, 6:3 (1958), 419–433 | DOI | Zbl

[2] Aronson J. E., “A survey of dynamic network flows”, Annals of Operations Research, 20:1 (1989), 1–66 | DOI | Zbl

[3] Erzin A. I., Takhonov I. I., “Equilibrium resource distribution in a network model”, Journal of Applied and Industrial Mathematics, 1:3 (2007), 293–302 | DOI | Zbl

[4] Fonoberova M., Lozovanu D., “The maximum flow in dynamic networks”, Computer Science Journal of Moldova, 12:3(36) (2004), 387–396 http://www.math.md/publications/csjm/issues/v12-n3/7570/ | Zbl

[5] Fonoberova M., Lozovanu D., “The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving”, Computer Science Journal of Moldova, 13:1(37) (2005), 29–36 http://www.math.md/publications/csjm/issues/v13-n1/8518/ | Zbl

[6] Klinz B., Woeginger G. J., “One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs”, Operations Research Letters, 22:4–5 (1998), 119–127 | DOI | Zbl

[7] Orlin J. B., “Maximum-throughput dynamic network flows”, Mathematical Programming, 27:2 (1983), 214–231 | DOI | Zbl

[8] Skorokhodov V. A., Chebotareva A. S., “The maximum flow problem in a network with special conditions of flow distribution”, Journal of Applied and Industrial Mathematics, 9:3 (2015), 435–446 | DOI | DOI | Zbl

[9] Erusalimskii Ya. M., Skorokhodov V. A., Kuz'minova M. V., Petrosyan A. G., Graphs with non-standard reachability: problems, application, Southern Federal University, Rostov-on-Don, 2009

[10] Skorokhodov V. A., “Flows on graphs with varying transit times through the arcs”, Izvestiya Vysshikh Uchebnykh Zavedenii. Severo-Kavkazskii Region. Ser. Estestvennye nauki, 2011, no. 1(161), 21–26 (in Russian)

[11] Kuz'minova M. V., “Periodic dynamic graphs. Maximum flow problem”, Izvestiya Vysshikh Uchebnykh Zavedenii. Severo-Kavkazskii Region. Ser. Estestvennye nauki, 2008, no. 1(143), 14–19 (in Russian)

[12] Kuznetsov O. P., Zhilyakova L. Yu., “Nonsymmetric resource networks. The study of limit states”, Management and Production Engineering Review, 2:3 (2011), 33–39

[13] Kuznetsov O. P., Zhilyakova L. Yu., “Bidirectional resource networks: A new flow model”, Doklady Mathematics, 82:1 (2010), 643–646 | DOI | Zbl

[14] Zhilyakova L. Yu., “Asymmetrical resource networks. I. Stabilization processes for low resources”, Automation and Remote Control, 72:4 (2011), 798–807 | DOI | Zbl

[15] Zhilyakova L. Yu., “Ergodic cyclic resource networks. I. Oscillations and equilibrium at low resources”, Upravlenie Bol'shimi Sistemami, 43 (2013), 34–54 (in Russian)

[16] Zhilyakova L. Yu., “Ergodic cyclic resource networks. II. High levels of resource”, Upravlenie Bol'shimi Sistemami, 45 (2013), 6–29 (in Russian)

[17] Skorokhodov V. A., Abdulrahman H., “Dynamic resource networks. The case of small resource”, Vestnik Voronezhskogo Gosudarstvennogo Universiteta. Ser. Fizika. Matematika, 2018, no. 4, 186–194 (in Russian)

[18] Novikov F. A., Discrete mathematics, Piter, Saint Petersburg, 2013

[19] Gantmacher F. R., The theory of matrices, v. 1, AMS, Providence, RI, 2000

[20] Skorokhodov V. A., “Stability and stationary distribution on graphs with non-standard reachability”, Izvestiya Vysshikh Uchebnykh Zavedenii. Severo-Kavkazskii Region. Ser. Estestvennye nauki, 2007, no. 4(140), 17–21 (in Russian)

[21] Skorokhodov V. A., “The problem of finding the threshold value in ergodic resource network”, Upravlenie Bol'shimi Sistemami, 63 (2016), 6–23 (in Russian)