Abstract
This paper considers a generalized fuzzy version of maximum flow problem in which arc capacities are fuzzy variables. The problem is to find a maximum flow under some chance constraints with respect to credibility measure of arc flow of network. Some crisp equivalents of fuzzy chance constraints are presented when the fuzzy capacities are characterized by trapezoidal fuzzy numbers and general fuzzy numbers respectively. Furthermore, a genetic algorithm is used to solve the maximum flow with these crisp equivalents. Finally, a numerical example is provided for the effectiveness of the model and algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ji, X., Yang, L., Shao, Z. (2006). Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)