Abstract
This paper is devoted to the task of the two-commodity maximum flow finding in a fuzzy temporal graph. Arcs of the network are assigned by the fuzzy arc capacities and crisp transit times. All network’s parameters can vary over time, therefore, it allows to consider network as dynamic one. The task is to maximize total flow passing through the network, considering temporal nature of the network. Such methods can be applied in the real railways, roads, when it is necessary to take into account the commodities of two types solving the task of the optimal cargo transportation, for example, passenger and cargo trains or motor cars and lorries Method of operating fuzzy numbers for flow tasks is proposed that doesn’t lead to the blurring of the resulting number.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
McBride, R.D., Carrizosa, E., Conde, E., Munoz-Marquez, M.: Advances in solving the multi-commodity flow problem. Interfaces 28(2), 32–41 (1998)
Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, New York (1993)
Sedeño-Noda, A., González-Martín, C., Alonso-Rodríguez, S.: A new strategy for the undirected two-commodity maximum flow problem. Comput. Optim. Appl. 47(2), 289–305 (2010)
Hu, T.C.: Multi-commodity network flows. Oper. Res. 11, 344–360 (1963)
Rajagopalan, S.: Two-commodity flow. Oper. Res. Lett. 15, 151–156 (1994)
Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1–66 (1989)
Fonoberova, M.: Algorithms for finding optimal flows in dynamic networks. In: Rebennack, S., et al. (eds.) Handbook of Power Systems II, Energy Systems, pp. 31–54. Springer, Heidelberg (2010). doi:10.1007/978-3-642-12686-4
Glockner, G., Nemhauser, G.: A dynamic network flow problem with uncertain arc capacities: formulation and problem structure. Oper. Res. 48(2), 233–242 (2002)
Bozhenyuk, A., Gerasimenko, E., Kacprzyk, J., Rozenberg, I.: Flows in Networks Under Fuzzy Conditions. Studies in Fuzziness and Soft Computing, vol. 346. Springer, Heidelberg (2017)
Bozhenyuk, A., Gerasimenko, E., Rozenberg, I., Perfilieva, I.: Method for the minimum cost maximum flow determining in fuzzy dynamic network with nonzero flow. In: Alonso, J.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, 30th June–3rd July, Gijón, Asturias (Spain), vol. 89, pp. 385–392. Atlantic Press (2016). doi:10.2991/ifsa-eusflat-15.2015.56
Chanas, S., Kolodziejczyk, W.: Integer flows in network with fuzzy capacity constraints. Networks 16, 17–31 (1986)
Chanas, S.: Fuzzy optimization in networks. In: Kacprzyk, J., Orlovski, S.A. (eds.) Optimization Models Using Fuzzy Sets and Possibility Theory, pp. 303–327. D. ReideI Publishing Company, Dordrecht (1987)
Acknowledgments
This work has been supported by the Russian Foundation for Basic Research, Project №. 16-01-00090 a, and the Ministry of Education and Science of the Russian Federation under Project No. 213.01-11/2014-48 (Base part, State task 2014/174).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Bozhenyuk, A., Gerasimenko, E., Rozenberg, I. (2018). Method of Maximum Two-Commodity Flow Search in a Fuzzy Temporal Graph. In: Kacprzyk, J., Szmidt, E., Zadrożny, S., Atanassov, K., Krawczak, M. (eds) Advances in Fuzzy Logic and Technology 2017. EUSFLAT IWIFSGN 2017 2017. Advances in Intelligent Systems and Computing, vol 641. Springer, Cham. https://doi.org/10.1007/978-3-319-66830-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-66830-7_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66829-1
Online ISBN: 978-3-319-66830-7
eBook Packages: EngineeringEngineering (R0)