Abstract
Methods for calculating the max network flow with min cut and a flow of min cost, considering the risk on the separate sections of the network, are proposed in this work. The capacity of each arc is so defined, that it does not exceeds ‘the physical’ arc constraints as well as the admissible risk of the arc network flow function. The maximal flow of minimal cost is calculated in two steps – first the max flow is calculated, and then on the base of this value the optimal arc functions of min cost are defined. Three numerical examples are described which illustrate the potentials of the proposed methods for optimization of the network flows with risks. The concepts of ‘minimal cut of the network risk’ and ‘max flow of min cost and min cut of network risk’ are introduced.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Klinke, A., Renn, O.: A New Approach to Risk Evaluation and Management: Risk-Based, Precaution-Based, and Discourse-Based Strategies. Risk Analysis 22(6), 1035–1209 (2002), doi:10.1111/1539-6924.00274
ISO 31000:2009
http://www.ga.gov.au/hazards/our-techniques/modelling/how-do-we-estimate-risk-and-impact.html
http://www.lunduniversity.lu.se/o.o.i.s?id=12683&postid=584803 , ISBN 951-564-393-7
Christofides, N.: Graph theory: An Algorithmic Approach. Academic Press, London (1986)
Sgurev, V.: Network Flows with General Constraints. Publishing House of the Bulgarian Academy of Sciences, Sofia (1991) (in Bulgarian)
Jensen, P.A., Barnes, J.W.: Network flow programming. John Wiley and Sons, Inc., New York (1980)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Genova, K., Kirilov, L., Guliashki, V., Staykov, B., Vatov, D.: A Prototype of a Web-based Decision Support, System for Building Models and Solving Optimization and Decision Making Problems. In: Rachev, B., Smrikarov, A. (eds.) Proceedings of XII International Conference on Computer Systems and Technologies, CompSysTech 2011, Wien, Austria, June 16-17, vol. 578, pp. 167–172. ACM (2011), http://weboptim.iinf.bas.bg/ , ISBN 978-1-4503-0917-2
http://eur-lex.europa.eu/LexUriServ/LexUriServ.do?uri=OJ:L:2010:207:0001:0013:EN:PDF
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sgurev, V., Drangajov, S. (2015). Intelligent Control of Flows with Risks on a Network. In: Filev, D., et al. Intelligent Systems'2014. Advances in Intelligent Systems and Computing, vol 323. Springer, Cham. https://doi.org/10.1007/978-3-319-11310-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-11310-4_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11309-8
Online ISBN: 978-3-319-11310-4
eBook Packages: EngineeringEngineering (R0)