Article

Article title MINIMUM COST FLOW DEFINING IN FUZZY DYNAMIC GRAPH
Authors A.V. Bozhenyuk, E.M. Gerasimenko, I.N. Rosenberg
Section SECTION III. ALGORITHMIC AND THE SOFTWARE
Month, Year 05, 2013 @en
Index UDC 681.327
DOI
Abstract This article describes a method for minimum cost flow finding in a fuzzy dynamic graph with fuzzy arc capacities and values of transmission costs. This problem is relevant due to the fact that fuzzy nature of arc capacities and transmission costs is taken into account. It allows us to make decisions more sensitive to environmental changes. The time factor, i.e. the condition of non instant passing of flow along the arcs of the graph, is also taken into account. The ability of the raph’s parameters chan e over time, in particular, arc capacities, transmission costs and transit times dependence on the time of flow departure is also considered. The described algorithm can be used for solving applied problems on the rail, air and other roads.

Download PDF

Keywords Dynamic graph; minimum cost flow; fuzzy arc capacity; fuzzy cost.
References

Comments are closed.