Models and algorithm of maximum flow problem in uncertain network

Authors:
Chen Zhou;Jin Peng
Affiliations:
College of Mathematics & Science, Shanghai Normal University, Shanghai, China;Institute of Uncertain Systems, Huanggang Normal University, Hubei, China
Venue:
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
Year:
2011

Citing 5
Cited 0

Uncertainty Theory

Uncertainty Theory
Theory and Practice of Uncertain Programming

Theory and Practice of Uncertain Programming
Chance constrained maximum flow problem with fuzzy arc capacities

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Network flow problems with fuzzy arc lengths

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty

Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network flow problem covers a wide range of engineering and management applications. The maximum flow problem is to find the maximum amount of flow from the source to the sink within a network. Different from the existing works, this paper investigates maximum flow problem in which all arc capacities of the network are uncertain variables. Some models of maximum flow problem with uncertain arc capacities are exhibited. And then, the algorithm for solving maximum flow problem is introduced. As an illustration, an example is provided to show the effectiveness of the algorithm.