Abstract
Tasks, considered in the first chapter of the present book, assume instant flow transition along the arcs of the graph. The present paper deals with dynamic networks, i.e. such a networks, in which flow spends certain time passing along the arcs of the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chabini I, Abou-Zeid M (2003) The Minimum cost flow problem in capacitated dynamic networks. Annual Meeting of the Transportation Research Board, Washington D.C., pp 1–30
Bozhenyuk А, Rozenberg I, Starostina T (2006) Analiz i issledovaniye potokov i zhivuchesti v transportnykx setyakh pri nechetkikh dannykh. Nauchnyy Мir, Moskva
Bozhenyuk А, Rogushina E (2011) Method of maximum flow finding in fuzzy temporal network. European researcher. Multi Sci Periodical 5–1(7):582–583
Miller-Hooks E, Patterson SS (2004) On solving quickest time problems in time-dependent, dynamic network. J Math Model Algorithms 3:39–71
Bozhenyuk A, Gerasimenko E (2014) Flows finding in networks in fuzzy conditions. In: Kahraman C, Öztaysi B (eds) Supply chain management under fuzzines, studies in fuzziness and soft computing, vol 313, Part III, pp 269–291. Springer, Berlin. doi:10.1007/978-3-642-53939-8_12
Bozhenyuk А, Gerasimenko E, Rozenberg I (2012) Algorithm of maximum dynamic flow finding in a fuzzy transportation network. In: Proceedings of east west fuzzy colloquium 2012 19th fuzzy colloquium, pp 125–132, 5–7 Sept
Fonoberova M (2006) On determining the minimum cost flows in dynamic networks. Bul Acad Ştiinţe Repub Mold Mat 1:51–56
Fonoberova M, Lozovanu D (2004) The optimal flow in dynamic networks with nonlinear cost functions on edges. Bullet Acad Sci Moldova Math 3(46):10–16
Bozhenyuk AV, Gerasimenko EM, Rozenberg IN (2013) Minimum cost flow defining in fuzzy dynamic graph. Izvestiya SFedU. Eng Sci 5(130):149–154
Dijkstra EW (1959) A note on two problems in connextion with graphs. Numer Math 1:269–271
Edmonds J, Karp RM (1972) Theoretical Improvements in algorithmic efficiency for network flow problems. J Assoc Comput Mach 19(2):248–264
Tomizawa N (1971) On some techniques useful for solution of transportation network problems. Networks 1:173–194
Gerasimenko EM (2014) Potentials method for minimum cost flow defining in fuzzy dynamic graph. Izvestiya SFedU. Eng Sci 4:83–89
Pouly A (2010) Minimum cost flows. 23 Nov 2010. http://perso.ens-lyon.fr/eric.thierry/Graphes2010/amaury-pouly.pdf
Bozhenyuk A, Gerasimenko E (2013) Algorithm for monitoring minimum cost in fuzzy dynamic networks. Inf Technol Manag Sci (RTU Press, Riga) 16(1):53–59. doi:10.2478/itms-2013-0008
Bozhenyuk A, Gerasimenko E, Rozenberg I, Perfilieva I (2015) Method for the minimum cost maximum flow determining in fuzzy dynamic network with nonzero flow bounds. In: Alonso José M, Bustince H, Reformat M (eds) Proceedings of the 2015 conference of the international fuzzy systems association and the european society for fuzzy logic and technology, vol 89, pp 385–392. 30th June–3rd July. Atlantic Press, Gijón, Asturias (Spain). ISBN (on-line) 978-94-62520-77-6. ISSN 1951-6851. doi:10.2991/ifsa-eusflat-15.2015.56
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bozhenyuk, A.V., Gerasimenko, E.M., Kacprzyk, J., Rozenberg, I.N. (2017). Flow Tasks Solving in Dynamic Networks with Fuzzy Lower, Upper Flow Bounds and Transmission Costs. In: Flows in Networks Under Fuzzy Conditions. Studies in Fuzziness and Soft Computing, vol 346. Springer, Cham. https://doi.org/10.1007/978-3-319-41618-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-41618-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41617-5
Online ISBN: 978-3-319-41618-2
eBook Packages: EngineeringEngineering (R0)