DETERMINATION OF MAXIMUM FLOW IN A FUZZY PERIODIC GRAPH

The article illustrates a method for finding the maximum value of a dynamic flow using periodicgraphs, presented in the form of a generalized network. The interest in networks of this type is explainedby their wide practical application in places where there is periodicity, for example, management of periodicpassenger transportation on various types of transport, freight transportation, including goods with ashort shelf life, management of road traffic flow, namely regulation traffic lights, taking into account frequencyand workload. At the same time, the values of the bandwidth of the arcs of the networks underconsideration may vary depending on the time of departure of the stream and possible cycles, so we turnto dynamic networks. Network parameters are presented in a fuzzy form due to the influence of environmentalfactors and human activity. And the choice of periodic graphs is due to the presence of cycles andthe frequency of time intervals. The considered types of networks can be implemented on real roads duringtransportation. To solve the identified problem, within the framework of the presented work, a brief overviewof literary sources is provided, which allows us to assess the current level of development of systemsfor such purposes. As a result of this review, it was found that the most effective methods of solving theproblem posed are the use of fuzzy periodic graph methods. In this regard, it was decided to conduct astudy of these methods. The novelty of this work is determined based on the use of periodic temporal fuzzygraphs in solving the problem of finding the maximum flow of a dynamic network.