Method of the Maximum Dynamic Flow Finding in the Fuzzy Graph with Gains

2018 
The paper illustrates the method of the maximum flow value finding in a fuzzy weighted directed graph, which presented as a generalized network. The interest to such type of networks is explained by their wide practical implementation: they can deal with water distribution, money conversion, transportation of perishable goods or goods that can increase their value during transportation, like plants. At the same time the values of arc capacities of the considered networks can vary depending on the flow departure time, therefore, we turn to the dynamic networks. Network’s parameters are presented in a fuzzy form due to the impact of environment factors and human activity. Considered types of networks can be implemented in real roads during the process of transportation. The numerical example is given that operated data from geoinformation system “ObjectLand” that contains information about railway system of Russian Federation.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    8
    References
    0
    Citations
    NaN
    KQI
    []