Method of Maximum Two-Commodity Flow Search in a Fuzzy Temporal Graph
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.
KeywordsFuzzy dynamic graph Two-commodity fuzzy flow
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).
- 9.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)Google Scholar
- 10.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