Method for the minimum cost maximum flow determining in fuzzy dynamic network with nonzero flow bounds
نویسندگان
چکیده
In this paper the method for the minimum cost flow determining in fuzzy dynamic network with nonzero lower flow bounds is proposed. Considered method takes into account fuzzy nature of networks’ parameters and deals with fuzzy arc flow bounds, fuzzy transmission costs. Fuzzy arc flow bounds, costs and transit times can vary depending on the flow departure time. The method allows introducing the notion of “fuzzy network” instead of “stationary-dynamic” network, considered in conventional flow literature. The sphere of application for considered problem is presented.
منابع مشابه
Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks
The present paper examines the task of minimum cost flow finding in a fuzzy dynamic network with lower flow bounds. The distinguishing feature of this problem statement lies in the fuzzy nature of the network parameters, such as flow bounds, transmission costs and transit times. The arcs of the considered network have lower bounds. Another feature of this task is that fuzzy flow bounds, costs a...
متن کاملMaximum Dynamic Flow Finding Task with the Given Vitality Degree
This paper is devoted to the task of the maximum flow finding with nonzero lower flow bounds taking into account given vitality degree. Transportation network with the flow is considered in fuzzy conditions due to the fuzzy character of the network’s parameters. Arcs of the network are assigned by the fuzzy arc capacities and nonzero lower flow bounds, vitality parameters and crisp transit time...
متن کاملMethods for Maximum and Minimum Cost Flow Determining in Fuzzy Conditions
This article considers the problems of maximum flow and minimum cost flow determining in fuzzy network. Parameters of fuzzy networks are fuzzy arc capacities in the case of maximum flow finding and transmission costs of one flow unit in the case of minimum cost flow finding. These parameters are represented as fuzzy triangular numbers. Conventional rules of operating with fuzzy triangular numbe...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کامل