DEVELOPMENT OF METHODS FOR SUPPLY MANAGEMENT IN TRANSPORTATION NETWORKS UNDER CONDITIONS OF UNCERTAINTY OF TRANSPORTATION COST VALUES
The problem of transport management in a distributed logistics system "suppliers – consumers" is considered. Under the assumption of a random nature of transportation costs, an exact algorithm for solving this problem by a probabilistic criterion has been developed. This algorithm is implemented by an iterative procedure for sequential improvement of the transportation plan. The rate of convergence of a computational procedure to an exact solution depends significantly on the dimension of the problem and is unacceptably low in real problems. In this regard, an alternative method is proposed, based on reducing the original problem to solving a nontrivial problem of fractional-nonlinear programming. A method for solving this problem has been developed and substantiated. The corresponding computational algorithm reduces the fractional-nonlinear model to the quadratic one. The resulting problem is solved by known methods. Further, the original problem is supplemented by considering a situation that is important for practice, when in the conditions of a small sample of initial data there is no possibility of obtaining adequate analytical descriptions for the distribution densities of the random costs of transportation. In this case, the available volume of statistical material is sufficient only to estimate the first two moments of unknown distribution densities. For this marginal case, a minimax method for finding the transportation plan is proposed. The first step is to solve the problem of determining the worst distribution density with the given values of the first two moments. In the second step, the transportation plan is found, which is the best in this most unfavorable situation, when the distribution densities of the random cost of transportation are the worst. To find such densities, let’s use the modern mathematical apparatus of continuous linear programming
Nesterov, E. P. (1962). Transportnaya zadacha lineynogo programmirovaniya. Moscow: Izd. MPS, 189.
Yudin, D. B., Gol'shteyn, E. G. (1969). Zadachi lineynogo programmirovaniya transportnogo tipa. Moscow: «Sov. radio», 382.
Chumakov, V. B. (2006). Reshenie zadach organizatsii avtomobil'nyh perevozok v usloviyah neopredelennosti sostoyaniya regional'nyh transportnyh sistem. Vestnik Severo-Kavkazskogo federal'nogo universiteta, 5, 22–26.
Malakhov, V. P., Kondratenko, H. V. (2002). Imitatsiyni modeli ta alhorytmy formuvannia marshrutiv i traiektoriy na osnovi nechitkoi lohiky. Trudy Odesskogo politehnicheskogo universiteta, 2, 72–80.
Rosandich, R. G. (2005). Quantification on Uncertainty in Transportation Infrastructure Projects. Santiago: Economics planning.
Borisova, E. A., Finaev, V. I. (2006). Triaksial'naya raspredelitel'naya zadacha s nechetkimi parametrami. Izvestiya Yuzhnogo federal'nogo universiteta. Tehnicheskie nauki, 8, 17–21.
Borisova, E. A., Finaev, V. I. (2007). Trehindeksnye raspredelitel'nye zadachi s nechetkimi parametrami. Taganrog: TTI YUFU, 190.
Ermol'ev, Yu. M. (1976). Metody stohasticheskogo programmirovaniya. Moscow: Nauka, 239.
Kaplinskii, A. I., Poznyak, A. S., Propoy, A. I. (1971). On certain methods of solving problems of stochastic programming. Automation and Remote Control, 32 (10), 1609–1616.
Porotskiy, S. M. (1977). Stohasticheskie zadachi transportnogo tipa. Izv. AN SSSR. Tehn. Kibernetika, 6, 34–39.
Yudin, D. B., Yudin, A. D. (2009). Ekstremal'nye modeli v ekonomike. Moscow: LIBROKOM, 312.
Yudin, D. B. (1979). Zadachi i metody stohasticheskogo programmirovaniya. Moscow: «Sov. radio», 385.
Seraya, O. V. (2010). Mnogomernye modeli logistiki v usloviyah neopredelennosti. Kharkiv: VOP Stetsenko, 512.
Raskin, L. G., Kirichenko, I. O. (2005). Kontinual'noe lineynoe programmirovanie. Kharkiv: VIVV, 175.
Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8 (3), 338–353. doi: https://doi.org/10.1016/s0019-9958(65)90241-x
Dyubua, D., Prad, A. (1990). Teoriya vozmozhnostey. Prilozhenie k predstavleniyu znaniy v informatike. Moscow: Radio i svyaz', 286.
Raskin, L. G., Seraya, O. V. (2008). Nechetkaya matematika. Osnovy teorii. Prilozheniya. Kharkiv: Parus, 352.
Pawlak, Z. (1982). Rough sets. International Journal of Computer & Information Sciences, 11 (5), 341–356. doi: https://doi.org/10.1007/bf01001956
Domin, D. (2013). Artificial orthogonalization in searching of optimal control of technological processes under uncertainty conditions. Eastern-European Journal of Enterprise Technologies, 5 (9 (65)), 45–53. doi: https://doi.org/10.15587/1729-4061.2013.18452
Raskin, L., Sira, O. (2016). Fuzzy models of rough mathematics. Eastern-European Journal of Enterprise Technologies, 6 (4 (84)), 53–60. doi: https://doi.org/10.15587/1729-4061.2016.86739
Raskin, L., Sira, O. (2016). Method of solving fuzzy problems of mathematical programming. Eastern-European Journal of Enterprise Technologies, 5 (4 (83)), 23–28. doi: https://doi.org/10.15587/1729-4061.2016.81292
Copyright (c) 2021 Lev Raskin, Oksana Sira, Yurii Parfeniuk, Kseniia Bazilevych
This work is licensed under a Creative Commons Attribution 4.0 International License.
Our journal abides by the Creative Commons CC BY copyright rights and permissions for open access journals.
Authors, who are published in this journal, agree to the following conditions:
1. The authors reserve the right to authorship of the work and pass the first publication right of this work to the journal under the terms of a Creative Commons CC BY, which allows others to freely distribute the published research with the obligatory reference to the authors of the original work and the first publication of the work in this journal.
2. The authors have the right to conclude separate supplement agreements that relate to non-exclusive work distribution in the form in which it has been published by the journal (for example, to upload the work to the online storage of the journal or publish it as part of a monograph), provided that the reference to the first publication of the work in this journal is included.