IMPLEMENTATION OF THE DYNAMIC, COMPETITIVE AND FUZZY MODELS FOR PLANNING OF THE MULTI-PRODUCT FLOWS IN TRANSPORT NETWORKS
DOI:
https://doi.org/10.15802/stp2018/133742Keywords:
transport networks, planning models for maximum inhomogeneous flows, fuzzy and dynamic flows, competitive information flows, parallel algorithmsAbstract
Purpose. The purpose of the article is to develop a new unified procedure for planning of the fuzzy multi-product, dynamic and competitive flows in the transport networks and in the information network systems. The procedure is based on the use of the parallel synchronous algorithms for inhomogeneous maximum flows calculating. Methodology. The paper proposes the mathematical models’ classification of the tasks for planning the flows in transport networks. The possibilities of using the unified procedure and the parallel synchronous algorithm for calculating the maximum inhomogeneous flows for implementation of the tasks for planning multi-product, fuzzy, dynamic and competitive flows are investigated. The efficiency and universality of the proposed methods for the planning inhomogeneous flows is established by comparing the results of the calculations obtained in the article with the known results. Findings. The article proposes classification of the mathematical models for the planning inhomogeneous flows in the transport networks. The unified procedure and the parallel synchronous algorithm for planning fuzzy multi-product, dynamic and competitive flows in the transport networks have been developed. The tasks of the optimal distribution of the fuzzy multi-product, dynamic and competitive flows in the transport networks are realized. Originality. The article describes the new unified procedure for planning fuzzy multi-product, dynamic and competitive flows in the transport and information systems, using the parallel synchronous algorithms for calculating maximum flows. The procedure allows us to calculate the local extrema of the optimal flows distribution models. Practical value. The practical value of the obtained results is determined by the unified capabilities and the procedure efficiency, as well as the parallel synchronous algorithm designed to calculate the maximum multi-product flows in transport networks. The developed procedure provides the possibility to solve the analysis and planning problems of the multi-product flows in the networks for dynamic, fuzzy and competitive models for the distribution of the transport and information flows.
References
Shtayn, K., Rivest, R., Kormen, T., & Leyzerson, C. (2010). Algoritmy: postroenie i analiz. Moscow: Publisher Vilyams. (in Russian)
Osin, V. N. (2014) Effektivnoe raspredelenie informatsionnykh potokov v setevoy informatsionnoy sisteme na osnove nechetkikh modeley. (Avtoreferat dysertatsii kandydata tekhnicheskikh nauk). Tambov State Technical University, Tambov. (in Russian)
Skalozub, V. V., Tseytlin, S. Y., & Cherednichenko, M. S. (2016). Intellektualnye informatsionnye tekhnologii i sistemy zheleznodorozhnogo transporta. In A. I. Mikhaleva (Ed.), Sistemnye tekhnologii modelirovaniya slozhnykh protsessov: Monografiya (pp. 560-589). Dnipro. (in Russian)
Skalozub, V. V., & Panik, L. A. (2007). Modelirovanie i analiz potokovykh zadach s neodnorodnymi nositelyami. Bulletin of Dnipropetrovsk National University of Railway Transport named after Academician V. Lazaryan, 19, 125-133. (in Russian)
Skalozub, V. V., & Panik, L. O. (2017). Paralelni synkhronni alhorytmy analizu ta planuvannia neodnoridnykh potokiv u transportnykh merezhakh. System technology: Regional intercollegiate collection of scientific works, 5(112), 183-197. (in Ukranian)
Fillips, D. I., & Garsia-Dias, A. (1984). Metody analiza setey. Moscow: Publisher Mir. (in Russian)
Bozhenyuk, А. & Gerasimenko, E. (2013). Algorithm for Monitoring Minimum Cost in Fuzzy Dynamic Networks. Information Technology and Management Science, 16(1), 53-59. doi: 10.2478/itms-2013-0008 (in English)
Grigoriadis, M. D., & Khachiyan, L. G. (1996). Approximate minimum-cost multicommodity flows in $$tilde O$$ (ɛ −2 KNM) timetime. Mathematical Programming, 75(3), 477-482. doi: 10.1007/bf02592195 (in English)
Holzhauser, M., Krumke, S. O., & Thielen, C. (2016). Maximum flows in generalized processing networks. Journal of Combinatorial Optimization, 33(4), 1226-1256. doi: 10.1007/s10878-016-0031-y (in English)
Kovacs, P. (2013). Minimum-cost flow algorithms: An experimental evaluation EGRES Technical Report. EGRES Technical Report, 4, 1-40. Retrieved from https://web.cs.elte.hu/egres/tr/egres-13-04.pdf (in English)
Bozhenyuk, A. V., Gerasimenko, E. M., Kacprzyk, J., & Rozenberg, I. N. (2016). Maximum and Minimum Cost Flow Finding in Networks in Fuzzy Conditions. Flows in Networks Under Fuzzy Conditions, 23-75. Cham: Springer. doi: 10.1007/978-3-319-41618-2_2 (in English)
Nasrabadi, E., & Hashemi, S. M. (2010). Minimum cost time-varying network flow problems. Optimization Methods and Software, 25(3), 429-447. doi :10.1080/10556780903239121 (in English)
Schiopu, C., & Ciurea, E. (2016). The Maximum Flows in Planar Dynamic Networks. International Journal of Computers Communications & Control, 11(2), 282-291. doi: 10.15837/ijccc.2016.2.2444 (in English)
Sifaleras, A. (2013). Minimum cost network flows: Problems, algorithms, and software. Yugoslav Journal of Operations Research, 23(1), 3-17. doi: 10.2298/YJOR121120001S (in English)
Downloads
Published
How to Cite
Issue
Section
License
Copyright and Licensing
This journal provides open access to all of its content.
As such, copyright for articles published in this journal is retained by the authors, under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0). The CC BY license permits commercial and non-commercial reuse. Such access is associated with increased readership and increased citation of an author's work. For more information on this approach, see the Public Knowledge Project, the Directory of Open Access Journals, or the Budapest Open Access Initiative.
The CC BY 4.0 license allows users to copy, distribute and adapt the work in any way, provided that they properly point to the author. Therefore, the editorial board of the journal does not prevent from placing published materials in third-party repositories. In order to protect manuscripts from misappropriation by unscrupulous authors, reference should be made to the original version of the work.
