CC BY
15
UDC 656.2
Turpak S. M.1, Taran I. O.2, Ostrohliad O. O.3
1Dr. Sc., Associate Professor, Professor of the Department of Transport Technologies of Zaporizhzhia National Technical
University, Zaporizhzhia, Ukraine
2Dr. Sc., Professor, Professor of the Department of Transport Management; State Higher Educational Institution "National Mining
University", Dnipro, Ukraine
3Postgraduate student, transport logistician at "Meta-Trans" Ltd, Zaporizhzhia, Ukraine
IMPROVEMENT OF A SYSTEM CONTROLLING A PROCESS OF RAILCARS UNLOADING IN THE CONTEXT OF CHANGES _IN TEMPERATURE MODE WHILE OPERATING_
Context. The problems of cost minimizing for the delivery of raw materials, fuel and materials, while meeting all the requirements of end user in terms of transportation, condition, quality and amount of the cargo, the compliance of the rolling stock with the equipment of unloading points, etc. are still the key problems of efficient transportation management. A problem to improve a system controlling a process of cargo operations performance at industrial enterprises during the cold season, when well-managed process is considerably complicated by the influence of stochastic fluctuations in the environmental temperature remains to be topical one. Delivery cost experiences significant increase due to the growth of power consumption for the cargo defrosting.
The objective of the paper is to improve a system controlling a process of railcars unloading in terms of expectations of the negative changes in the temperature mode owing to optimization of the railcars distribution among the unloading points by the criterion of the idle time minimization.
Method. Two temperature modes are singled out: standard operating mode in terms of positive temperatures and a mode of necessity to recover looseness of frozen cargos. The method of operative disbalance of incoming cargo flows has been developed to provide more rational distribution of cargos within cargo loading/unloading complexes during the periods of temperature changes being typical for Ukrainian climate. A new procedure to solve dynamic transportation problem with the varying intensity factor of incoming cargo flows in terms of time has been developed. A factor of minimum period for cargo operation has been proposed as an optimization criterion.
Results. Methodology has been developed basing upon a method of operative disbalance of incoming cargo flows. Experiments concerning the methodology application have been carried out to improve the system controlling the process of railcars unloading in terms of changes in temperature mode.
Conclusions. Analysis of the research results has shown that the proposed approach decreases significantly the idle time of the railcars in terms of temperature mode changes, reduces expenses connected with the railcars use as well as the expenses connected with the recovery cargo looseness and operation of locomotives.
Keywords: cargo flow, dynamic transportation problem, criterion of minimum time, disbalance of supply stock, optimum distribution.
NOMENCLATURE
A. is the amount of the ith cargo delivered per day;
a. , i s I is the amount of the ith cargo delivered to an enterprise;
B. is a maximum supply to the jth loading/unloading
complex;
b ,j J is the amount of the cargo delivered to the jth unloading complex of an enterprise;
N is a daily amount of possible supplies to a unloading complex;
t cargo Is a standard time to unload one railcar loaded
ij
with the ith cargo type at the jth loading complex;
t is a total idle time of railcars being unloaded, hrs;
cargo ^
x.p is the amount of the ith cargo delivered to jth loading complex in terms of the tth delivery;
z.p is the efficiency of the jth loading complex in terms of the ith cargo delivery taking into consideration the number of the tth delivery;
B m is a total cost of railcars being unloaded; B actuai is an actual cost of idle time of railcars arrived to
idle
an enterprise per day;
B.,,ca,c is a calculated value of idle time of railcars arrived
idle
to an enterprise per day;
Cjdk is a prime cost of one hour of idle time of a railcar, UAH;e
Ed is a cost saving per idle time of railcars being unloaded.
INTRODUCTION
A problem concerning the development and application of new approaches to the organization as well as control of transportation and cargo handling at the enterprise is the priority to improve its efficiency. Loading operations at the industrial enterprises depend on physical state of certain bulk cargos. During cold season such cargoes freeze requiring additional investment of time and energy to recover their looseness.
Under the above conditions, methods of the transportation management and control foresee measures to use preventing means against freezing; besides the measures should be aimed at accumulation of cargo stocks at the warehouses of a consuming enterprise during warm season being favorable for loading/unloading operations, establishing of points to heat frozen cargos in railcars as well as the use of other means to provide smooth process of loading/unloading operations.
The objective of the research was the improvement of a system controlling the process of railcars unloading under the conditions of possible changes in temperature mode of operation at the expense of optimization of the railcars
© TypnaK C. M., TapaH I. O., OcTporaag O. O., 2018 DOI 10.15588/1607-3274-2018-1-21
distribution among the unloading points according to the criterion of idle time minimization.
The development of new methods for effective use of technical means involved in transportation and technological processes remains the topical research area.
1 PROBLEM STATEMENT
Suppose that X matrix with x.p components is preset. The matrix is a set of the ith cargoes delivered to jth unloading complexes of the enterprise in terms of pth feed according to transportation plan.
To describe the transportation problem, introduce following designations for coefficients and variables: i £ I = {1, 2, ..., m}, a set of the indices of the cargo type; jJ = {1, 2, ..., n}, a set of indices for unloading complexes; pP = {1, 2, ..., k}, a set of delivery number indices. Mathematical formulation of such transportation problem
is (1):
m n k
F(X) = • xjp min,
i=1j=1t=1
if xyP > 0; i = 1, 2
m;j = 1, 2, ..., n;p = 1, 2, ..., k. It is required to minimize the number of railcars being unloaded within the unloading complexes. To do that, one should minimize time loses connected with raw material unloading.
An index of minimum time required for loading/unloading operations may be used as optimization criterion. 2 REVIEW OF THE LITERATURE
Logistic approach as for the optimization of cargo delivery processes is rather common [1-5]. Formation of objectives to improve the efficiency in the form of transportation problem while optimizing transportation process is quite popular. It depends on a great number of efficient methods for its solution.
However, practice often faces such problems which formalization cannot result in classic scheme of transportation problem. Solution of such problems requires serious methodological background, development of models and methods for cost optimization, and, what is more important, the development of decision-making support systems on the basis [6].
In terms of real organizational processes of cargo delivery, the intensity of raw materials supply and its demand are usually random values. Under such conditions, calculating factors of efficiency (namely, transportation cost) are also random values, if we mean optimizing problem solving. Together with standard properties of linear programming problem, the specific features stipulate a number of its peculiarities [7]. While solving optimization problem concerning cargo transportation from suppliers to consumers, current approach, unlike traditional methods, takes into consideration, for instance, such a condition that transportation cost is a random value with a preset distribution density [8].
Solving multiindex distribution problems often results in such problems as great dimension of the initial data and multiparametric character of the optimization problem [9]. There are various approaches to certain solutions of the
problems [10-14]; a theory of solving multiindex problems of linear programming in general form has been developed [15]. The solution of the multiindex transportation problem can be obtained by the method of potential; nevertheless, implementation of the method is labour-intensive since it contains numerous iterations. To make the initial support plan for the multiindex problem of transportation logistics, it is proposed to use the null-transformation method of the initial value matrices [16].
There are three-index planar transportation problems with nonlinear cost functions [17]. Metaheuristic evolutionary algorithm is proposed for an approximate solution of the problems. The advantages of parallel search with several populations are in a higher rate of convergence and stability of the time required to obtain the solutions.
No methodology alone is fully adapted to implement the method of operational disbalance of input cargo flows. It is necessary to form new procedures to be based on common optimization algorithms.
3 MATERIALS AND METHODS
A process of railcars unloading depends on the environmental conditions. Single out standard operation mode at positive temperature and the mode of necessity to recover looseness (for freezing cargos) at negative temperature. At the territory of Ukraine, cold season is characterized by frequent changes in temperature, and, accordingly, modes of railcars unloading.
Under such conditions, while waiting for the transition from the standard mode to the looseness recovery mode, unloading process optimization is possible by means of distribution of railcars among loading/unloading points according to the criterion of minimum time required for loading/unloading operations. The optimization relies upon the possibility to unload certain cargos within several points. In this context, planned balance of warehouse stock as for the cargos experiences certain disbalance, which can be recovered if temperature conditions improve and standard operation mode is applied. Fig. 1 demonstrates the method
Figure 1 - Scheme of cargo loading/unloading processes performance under conditions of changes in temperature operation mode
of operational disbalance of incoming cargo flows using the scheme of cargo loading/unloading processes performance proposed by the paper.
Optimization process of railcars unloading. To optimize the unloading process by means of correction of planned distribution of railcars among loading/unloading complexes, one can use a new procedure based on traditional methods of transportation problem solution (formula (1)).
Fig. 2 demonstrates graphical representation of the transportation problem.
Description of the optimization procedure for the process of railcars unloading in terms of small transportation systems of enterprises. For the enterprises with small amounts of raw material delivery (up to 100 railcars per day), the number of deliveries for a certain unloading complex is limited; it is convenient to present the transportation problem in an expanded form.
To do this, the "Unloading complex" column is divided into additional columns which number depends on the number of deliveries per each loading complex. As for each of the complexes, determine daily number of possible deliveries using formula (2):
N =
A
b,
(2)
It should be taken into consideration that in the ma.ority of cases the last delivery will be "incomplete"; thus, determine its dimension using formula (3):
Bjlast = A1 - Bj (N -1). (3)
For the first delivery series, zij1 value is taken as:
_ 1 = t cargo lij ,
Following cargo delivery should involve time spent to unload railcars from the first delivery:
_ 2 = t cargo +1 cargo B
¿ij lij Thj Uj .
Similarly, one can calculate z,p value for any number of deliveries (4):
= t,cargo (1 + Bj (N -1)).
(4)
Figure 2 - General arrangement of the transportation problem taking into account delivery number Table 1 - Cargo distribution for small transportation systems
Complex b1 b2 bn
Cargo b11 b12 bk b21 b22 b2k bnl bnl bnk
ai Z111 Z112 Z11k Z121 Z122 Z12 Z 1 Z1n Z1n Z k Z1n A1
a2 Z211 Z212 Z21k Z211 Z 2 Z22 Z k Z22 Z 1 Z2 n Z2n Z k Z2n A2
am Zm11 Zm12 Z k Zm1 Zm21 Zm22 Z k Zm2 Z 1 mn Z 2 mn Z k mn Am
B1 B1 B last B2 B2 B last Bn Bn t-> last Bn
B1 (N -1) + B" B2 (N -1) + B2last Bn (N-1) + Bntast
Description of the optimization procedure for the process of railcars unloading in terms of large transportation systems of enterprises. Large enterprises require constant delivery of raw materials for the continuous production. Such enterprises have more complicated transportation systems; thus, it is rather difficult to determine in advance the required number of deliveries and sometimes it is even impossible.
Transportation problem consisting of p-number of blocks depending on each other is proposed for such cases. Each of the blocks is a transportation problem for a separate delivery series. The initial data for the first delivery series are the cargo volumes arriving per the estimated period of time, maximum delivery amount per each unloading complex and the time required to unload one railcar in accordance with the capacity of each complex.
A. value is assumed as that being equal to the total number of railcars with a certain cargo delivered to the enterprise.
Since B. value is taken as the number of railcars within one
j
delivery, it is obvious that A. sum will exceed significantly Bj sum. Optimum plan of the problem will be singular one, i.e. not all cargo will be unloaded within loading/unloading complexes. Consequently, for the following delivery series, A. value will be equal to the number of the railcars remaining after the previous delivery, etc., until the whole cargo is distributed among loading/unloading complexes.
z } value for the first delivery series is assumed as that to be equal to the period required to unload one railcar with certain cargo within the corresponding complex. For all subsequent delivery series, z? value is found using formula (5):
+1,
cargo , Bl + cargo , „2 +... +
cargo d k 'j ' Bj
(5)
As a result, we obtain a transportation problem which general form is represented in Fig. 3.
4 EXPERIMENTS
To demonstrate implementation of the procedure optimizing a process of the railcars unloading, consider the application of the method for such transportation problem solving in terms "Zaporizhstal" integrated works.
Basic freezing cargoes (i.e. ore, coal, coke and limestone in hoppers and open box cars) arrive to five basic unloading complexes: Aglofabryka station, "Bunkery" park (railway lines #2 and #4), Rudna station, Vuhilna station, and Pidbirkova station. In this context, some of them can be unloaded only within one complex (ore and coal) while the rest are distributed among several complexes.
Each of the unloading complexes has different capacities. Unloading duration within certain complex depends on the delivered cargo type. Moreover, it should be taken into consideration that certain cargoes should be delivered only to certain complexes.
It is necessary to minimize the time spent for raw materials unloading.
The initial table of the transportation problem can be represented as follows (Table 2).
Since the amount of stock (volumes of cargo deliveries) is not equal to the sum of the demand (the delivery amount in terms of loading/unloading complexes), than the obtained transportation problem is open one. To solve the problem it is necessary to transform it into a closed one. To do this, introduce a theoretic consumer (loading/unloading complex) for excessive cargo amount.
Obtain optimum plan for the first delivery series cargo distribution within loading/ unloading complexes:
- "Bunkery" park, railway line #2 - 9 railcars with coke (0.43 hrs/railcar);
- "Bunkery" park, railway line # 4 - 9 hoppers with limestone (0.07 hrs/railcar);
Unloading ""^-»^omplcx CargîT»^ v b? b,! Total
Unloading ""^^omplex Total A:
Unloading CargïK-^ V V b,: Total A;
Unloading ^^coillplcx CargcT-"-^ W K b,1 h.2 Total
Unloading b,: bl hj Total A,2 a:
«1 i i i Z13 i A: A;
<h 1 1 -22 1 1 Z2„ A1 A 3 Au . IA, LB; ....
... A: LA, m ...
1 1 1 Ziii3 1 ^nnt A 1 Am p/
Total B2 B; B,
Figure 3 - General arrangement of transportation problem for transportation systems of metallurgical enterprises with continuous
production process
Table 2 - The initial table of the transportation problem of freezing cargos delivery to a metallurgical enterprise
Cargo Loading/unloading complex Total
"Bunkery" railway line #2 "Bunkery" railway line #4 Rudna station Vuhilna station Pidbirkova station
Ore - - 0.06 - - 137
Coal - - 0.06 0.06 - 17
Limestone in open box cars - - - - 0.32 23
Limestone in hoppers - 0.07 - - 0.07 37
Coke 0.43 - 0.06 - - 74
Total 9 9 15 14 9 288
56
- Rudna station - 15 railcars with ore (0.06 hrs/railcar);
- Vuhilna station - 14 railcars with coal (0.06 hrs/railcar);
- Pidbirkova station - 9 hoppers with limestone (0.07 hrs/railcar).
Minimum time spent to unload the first delivery series
is:
F(x) = 0.06-15 + 0.06-14 + 0.07-9 + 0.07-9 + 0.43-9 = 6.87 hrs.
As it is understood, the optimum plan is singular one as not the whole amount of cargo has been distributed. Thus, the rest of the cargo is transferred to following transportation problem of the second delivery series as A. value, and the unloading period per one railcar (zj value) is calculated using formula (5) taking into account cargo type and the unloading complex capacity (Fig. 4).
Similarly, all following delivery series are distributed until all the cargos are unloaded within the loading/unloading complexes.
5 RESULTS
Result of the dynamic transportation problem solving will help obtain optimum distribution of cargo deliveries to the unloading complexes:
- 9 coke series (8 of them are 9 railcars, and 1 is 2 railcars) will be delivered to Agglofabryka station, "Bunkery" park, railway line #2;
- 3 limestone series (2 of them are 9 railcars, and 1 is 1 railcars) will be delivered to Agglofabryka station, "Bunkery" park, railway line #4;
Initial table of transportation problem for the second delivery series
z
"""-v^ Unloading ^^^vçomplex Cargo "Bunkery" railway lines №2 "Bunkery" railway lines №4 Rudna station Vuhilna station Pidbirkova station Total
Ore (0 r~ — — 1 06+0.06-15) > 0.96 122 i
Unloading Cargo ^vl "Bunkery" railway lines №2 "Bunkery" railway lines №4 Rucfna station Vuhilna station Pidbirkova station The rest Total / ''I
Ore 0.06 '[15] 122 - "1*37 / i
Coal 0.06 [14] 3 -- ""11 A
Limestone in open box cars 23 — -"23 / /65 f
Limestone in hoppers 0.07 [9] 0.07 [9] 19 -- -"37 / /32 f
Coke 0.43 [9] 65 -- '""74 / / / s
Total 9 9 15 14 9 232 -- -"288
\
Optimum plan to distribute cargos within complexes of the first delivery series
Figure 4 - Calculation of the data and formation of the initial table for the transportation problem of the second delivery series
- 10 ore series (9 of them are 15 railcars, and 1 is 2 railcars) will be delivered to Rudna station;
- Vuhilna station will get 2 coal series (14 railcars and 3 railcars).
- 2 series of limestone in hoppers (9 railcars each) and 3 series of limestone in open box cars (2 series of 9 railcars and 1 series of 5 railcars) will be delivered to Pidbirkova station.
Table 3 contains total minimum time spent to unload all delivery series involving unloading complex as well as comparison of the obtained values with the actual ones.
The difference in the number of railcars within loading/ unloading complexes in the actual and calculated variant is insignificant. The difference can be easily added in a less
strenuous period, i.e. if the temperature conditions improve, when it will not be necessary to heat the cargos. Thus, one can assume that the requirements of all unloading complexes are met.
The difference between the actual and calculated idle time of railcars within the determined loading/unloading complexes is shown in Fig. 5.
The method cannot take into consideration the fact that under the conditions of continuous production period new cargos can arrive even before previous cargos were distributed and unloaded. The factor may affect significantly the capacity of loading/unloading complexes as well as the distribution of delivery series within the complexes. Therefore, in future it is planned to improve the optimization method of railcars unloading process.
Table 3 - Comparison of the obtained calculated values with the actual ones
Unloading complex Actual values Calculated values
Number of railcars Number of deliveries Total idle time, hrs Number of railcars Number of feeds Total idle time, hrs
"Bunkery", railway line #2 72 12 312.08 74 9 280.36
"Bunkery", railway line #4 15 6 51.25 19 3 11.41
Rudna station 140 15 136.58 137 10 121.74
Vuhilna station 16 2 18.67 17 2 12.3
Pidbirkova station 45 14 110.33 45 5 71.18
Total 288 49 628.92 288 29 496.99
ÙD ^
@ O
31
300.00
5 250.00
® 200.00
£ 150.00 o
c
0.00
2.08
\ \
\ \ \ V
\ \ \ \
\ \ \ \ \ \
136 .58
\ \ \ V y y ■ 11 c
\ \ \ \ / V1 / ^U-74 x> \\ \ V. i ± ^ s
\ \ V v / / / ^ / s
\\ \\ \\ / J /
V
A.\,\\
.33
71.IS
''Bunkery'" "Bunkery'" Rudna station
railway line №2 railway line №4
Unloading complexes
—•—Actual idle —■— C alculat ed idle
Vuhilna station
Pidbirkova station
Figure 5 - Curves of changes in railcars idle period within loading/unloading complexes
Total cost of idle time of the railcars being unloaded is determined using formula (6):
В — t • С
idle ~ cargo idle'
(6)
Cost of one hour of railcar idle time at "Zaporizhstal" PJSC as of January 2015 was 12.04 UAH/hour.
Therefore, the cost of idle time of the railcars arrived at the enterprise during 6 January 2015 actually was:
B,dieact"al = 12.04 • 628.92 = 7572.16 UAH.
Application of the above method of railcars distribution will help reduce the cost of idle time of those very railcars:
В
idle
calc
— 12.04 -496.99 — 5983.76 UAH.
Determine the cost savings in idle time of the railcars being unloaded and the railcars arrived within a day (7):
Е — в actual _ в calc Eday ~ Bidle Bidle •
Eday — 7572.16 _ 5983.76 = 1588.4 UAH.
(7)
6 DISCUSSION
Owing to more rational distribution of railcars according to the deliveries involving the capacity of loading/unloading complexes, the number of deliveries has experiences significant reduction. That makes it possible to shorten idle time of the railcars during when transportation system of an enterprise is overloaded. Cost savings can account for UAH 1.588,4 (21%) when the method is applied.
Average idle time of the railcars depended upon the necessity to heat cargos during cold season is 2 hours. Taking into consideration the number of days with a temperature differential, annual effect can be up to UAH 1500000 per year considering the reduction of expenditures connected with defrosting of cargos if it is required.
The proposed method does not take into account the necessity to recover the balance of incoming cargo flows and the replenishment of disbalanced warehouse stock; thus, it requires further improvement to obtain more accurate results and efficiency indices.
CONCLUSIONS
The paper has solved the burning problem concerning the improvement of a system controlling a process of railcars unloading in terms of expectations of the negative changes in the temperature mode owing to optimization of the railcars distribution among the unloading points by the criterion of the idle time minimization.
Scientific novelty of the research is that the innovative method of operational disbalance of incoming cargo flows has been proposed. The method makes it possible to organize more efficient operation loading/unloading complexes of an industrial enterprise, to shorten railcars idle time under the condition of frequent temperature changes during cold season.
A procedure to optimize a process of railcars unloading for small transportation systems of enterprises for short-time period has been proposed. The procedure solves dynamic transportation problem by means of its reducing to a common form.
A procedure optimizing a process of railcars unloading for large transportation systems of enterprises has been proposed. The procedure involves the dynamic transportation problem solving with time varying factor of intensity of incoming cargo flows.
Practical importance of the obtained results is as follows: at the expense of the use of operational disbalance of incoming cargo flows and procedures optimizing unloading process during cold season, optimization of transportation system functioning is performed according to the criterion of minimum railcars driveway time during unloading operations; that helps cut the cost for railcars use by 21%. Annual saving is up to UAH 1500000.
Prospects for the future research is to determine the effectiveness of the proposed method taking into consideration the reduction of idle time of railcars before their unloading and involving the replenishment of warehouse stock during transition period from the mode of unloading process optimization (when negative temperatures are forecasted) to the standard operational mode.
ACKNOWLEDGMENTS
The research has been carried out as the part of research and development project 02015 "Improvement of transportation and transportation and technological systems of Zaporizhzhia region" of the Department of Transportation Technologies of Zaporizhzhia National Technical University.
REFERENCES
1. Van der Aalst W. M. P. Logistics: A Systems Oriented Approach. / W. M. P. Van der Aalst // Proceedings of Third International Working Conference on Dynamic Modeling of Information Systems. - 1992. - P. 169-190.
2. Taha H. A. Operations Research: An Introduction / H. A. Taha. -Prentice Hall, 2006. - 838 p.
3. Nunez A. Hybrid Predictive Control for Dynamic Transport Problems. / A. Nunez, D. Saez. - Springer Verlag London, 2013. -169 p.
4. Stocchetti A. Supply chain management in industrial production. A retrospective view / A. Stocchetti, E. Scattola // MPRA Paper, University Library of Munich, Germany. - 2011. - 1(09). -P. 45-66.
5. Stock G. N. Enterprise logistics and supply chain structure: the role of fit / G. N. Stock, N. P. Greis, J. D. Kasarda // Journal of Operations Management. - 2000. - 18. - P. 531-547.
6. Косенко О. В. Модель управления на основе решения несимметричных транспортных задач / О. В. Косенко, И. В. Пушнина // Известия Южного федерального университета. Технические науки. - 2013. - № 2 (139). - C. 175-180.
7. Раскин Л. Г. Многоиндексные задачи линейного программирования (теория, методы, приложения) / Л. Г. Раскин, И. О. Кириченко. - М. : Радио и связь, 1982. - 240 с.
8. Дунаевская О. И. Задача транспортной логистики со случайной стоимостью перевозок / О. И. Дунаевская, Л. Г. Раскин // Вестник Харьковского национального автомобильно-дорожного университета. - 2007. - № 37. - С. 87-89.
9. Косенко О. В. Повышение эффективности методов решения многоиндексных задач распределения ресурсов / О. В. Косенко // Известия ЮФУ Технические науки. - 2016. - № 4 (177). -С. 73-81.
10. Нечитайло Н. М. Транспортная задача по критерию минимума общего времени с учетом потерь на промежуточную обработку ресурсов / Н. М. Нечитайло // Известия высших учеб-
ных заведений. Северо-Кавказский регион. Серия : естественные науки. - 2003. - № 3. - С. 11-14.
11. Осыкина Ю. А. Многокритериальная транспортная задача с разрывной целевой функцией / Ю. А. Осыкина, Г. Д. Черны-шова // Вестник Воронежского государственного университета. Серия: системный анализ и информационные технологии. - 2008. - № 2. - С. 10-12.
12. Котенко И. А. Транспортная задача линейного программирования на орграфе состояний системы массового обслуживания / И. А. Котенко, Е. Д. Шикина, С. Д. Туровец // Математическое моделирование и краевые задачи. Труды десятой всероссийской научной конференции с международным участием: в 3-х томах. - 2016. - С. 133-135.
13. Александров А. Э. Стохастическая постановка динамической транспортной задачи с задержками с учетом случайного разброса времени доставки и времени / А. Э. Александров, Н. В. Якушев // Управление большими системами : сборник трудов. - 2006. - Вып. 12-13. - С. 5-14.
14. Бочкарев А. А. Теория и методология процессного подхода к моделированию и интегрированному планированию цепи поставок: автореф. дис. ... д-ра эконом. наук: 09.09.09 / А. А. Бочкарев. - Санкт-Петербург: ГОУ ВПО «Санкт-Петербургский государственный инженерно-экономический университет», 2009. - 39 с.
15. Юдин Д. Б. Задачи и методы линейного программирования / Д. Б. Юдин, Е. Г. Гольштейн. - М. : Сов. радио, 1961. - 364 с.
16. Получение начального опорного плана многоиндексной задачи транспортной логистики / [Е. Б. Ахиезер, О. А. Геляров -ская, О. И. Дунаевская, Н. Т. Процай] // Радиоэлектроника и информатика. - 2014. - № 2 (65). - С. 16-18.
17. Пересветов В. В. Приближенное решение трехиндексных пла-нарных нелинейных транспортных задач / В. В Пересветов // Вестник ТОГУ. Информатика, вычислительная техника и управление. - 2015. - № 2(37). - С. 113-120.
Article was submitted 20.07.2017.
After revision 01.11.2017.
Турпак С. М.1, Таран I. О.2, Острогляд О. О.3
'Д-р техн. наук, доцент, професор кафедри транспортних технологш Запорiзького нацюнального техшчного ушверситету, Запо-рiжжя, Украша
2Д-р техн. наук, професор, професор кафедри управлшня на транспорт^ ДВНЗ «Нацюнальний прничий ушверситет», Дншро, Украша
3Спошукач, лопст по транспорту ТОВ «Мета-Транс», Запорiжжя, Укра1на
УДОСКОНАЛЕННЯ СИСТЕМИ УПРАВЛШНЯ ПРОЦЕСОМ РОЗВАНТАЖЕННЯ ВАГОН1В В УМОВАХ ЗМ1НИ ТЕМПЕРАТУРНОГО РЕЖИМУ РОБОТИ
Актуальтсть. Головними задачами ефективного управлшня на транспорт залишаються завдання мшiмiзаци витрат на доставку сировини, палива та матерiалiв за умов дотримання вах вимог ганцевого споживача щодо термтв перевезень, стану, якосп та галькосп вантажу, вщповщносп рухомого складу обладнанню вантажоприймальних пунк™ та ш. Серед цих завдань актуальною е задача удосконалення системи управлшня процесом виконання вантажних робгг на промислових шдприемствах в холодний перюд року, коли вщрегульований процес виконання вантажних робгг значним чином ускладнюеться шд впливом стохастичних коливань температури навколишнього середовища. Вартють доставки суттево збшьшуються через зростання витрати енергоносй'в на розморожування ван-тажiв.
Мета роботи - удосконалення системи управлшня процесом розвантаження вагошв в умовах очжування негативних змш температурного режиму роботи за рахунок оптимiзацil розпод^ вагошв по пунктах вивантаження за крш^ем мiнiмiзацil часу простою.
Метод. Видшено звичайний режим роботи при позитивних показниках температури та режим необхщносп вщновлення сипкосп вантаж1в, яга змерзаються. Розроблено метод оперативного дисбалансу вхщних вантажопотогав, який забезпечуе бiльш рацюнальний розподiл вантажiв по вантажним фронтам в перюди змiни температурних режимiв, який е характерним для ^мату Укра'ни. Була розроблена нова процедура розв'язку динамiчноl транспортно'' задачi зi змiнним фактором iнтенсивностi вхщних вантажопотокiв за часом. В якосп критерiю оптимiзацil запропоновано показник мтмального часу виконання вантажних операци.
Результати. На основi методу оперативного дисбалансу вхщних вантажопотокiв розроблено методику та проведено експеримен-ти по II застосуванню для удосконалення системи управлшня процесом розвантаження вагошв в умовах змши температурного режиму роботи.
Висновки. Аналiз результатiв дослiджень показав, що при запропонованому пiдходi значно скорочуеться простш вагонiв в умовах змiни температурних режимiв, зменшуються витрати на плату за користування вагонами, на вщновлення сипкосп вантажу та експлуа-тащю локомотивiв.
Ключовi слова: вантажопотiк, динамiчна транспортна задача, критерiй мiнiмального часу, порушення балансу запасiв, оптималь-ний розподш.
Турпак С. Н.1, Таран И. А.2, Острогляд Е. А.3
1Д-р техн. наук, доцент, профессор кафедры транспортных технологий Запорожского национального технического университета, Запорожье, Украина
2Д-р техн. наук, профессор, профессор кафедры управления на транспорте, ДВНЗ «Национальный горний университет», Днепр, Украина
3Соискатель, логист по транспорту ООО «Мета-Транс», Запорожье, Украина
СОВЕРШЕНСТВОВАНИЕ СИСТЕМЫ УПРАВЛЕНИЯ ПРОЦЕССОМ ВЫГРУЗКИ ВАГОНОВ В УСЛОВИЯХ ИЗМЕНЕНИЯ ТЕМПЕРАТУРНОГО РЕЖИМА РАБОТЫ
Актуальность. Главными задачами эффективного управления на транспорте остаются задачи минимизации затрат на доставку сырья, топлива и материалов при условии соблюдения всех требований конечного потребителя по срокам перевозок, состояния, качества и количества груза, соответствия подвижного состава оборудованию грузоприемных пунктов и др. Среди этих задач актуальной является задача совершенствования системы управления процессом выполнения грузовых работ на промышленных предприятиях в холодный период года, когда отрегулированный процесс выполнения грузовых работ в значительной степени осложняется под влиянием стохастических колебаний температуры окружающей среды. Стоимость доставки существенно увеличиваются из-за роста расхода энергоносителей на размораживание грузов.
Цель работы - совершенствование системы управления процессом разгрузки вагонов в условиях ожидания негативных изменений температурного режима работы за счет оптимизации распределения вагонов по пунктам выгрузки по критерию минимизации времени простоя.
Метод. Выделены обычный режим работы при положительных показателях температуры и режим необходимости восстановления сыпучести смерзающихся грузов. Разработан метод оперативного дисбаланса входящих грузопотоков, который обеспечивает более рациональное распределение грузов по грузовым фронтам в периоды смены температурных режимов, что характерно для климата Украины. Была разработана новая процедура решения динамической транспортной задачи с переменным фактором интенсивности входящих грузопотоков по времени. В качестве критерия оптимизации предложен показатель минимального времени выполнения грузовых операций.
Результаты. На основе метода оперативного дисбаланса входящих грузопотоков разработана методика и проведены эксперименты по ее применению для усовершенствования системы управления процессом разгрузки вагонов в условиях изменения температурного режима работы.
Выводы. Анализ результатов исследований показал, что при предложенном подходе значительно сокращается простой вагонов в условиях изменения температурных режимов, уменьшаются расходы на плату за пользование вагонами, на восстановление сыпучести груза и эксплуатацию локомотивов.
Ключевые слова: грузопоток, динамическая транспортная задача, критерий минимального времени, нарушение баланса запасов, оптимальное распределение.
REFERENCES
1. Van der Aalst W. M. P. Logistics: A Systems Oriented Approach, Proceedings of Third International Working Conference on Dynamic Modeling of Information Systems, 1992, pp. 169-190.
2. Taha H. A. Operations Research: An Introduction. Prentice Hall, 2006, 838 p.
3. Nunez A., Saez D. Hybrid Predictive Control for Dynamic Transport Problems. Springer Verlag London, 2013, 169 p.
4. Stocchetti A., Scattola E. Supply chain management in industrial production. Aretrospective view, MPRA Paper, University Library of Munich, Germany, 2011, 1(09), pp. 45-66.
5. Stock G. N., Greis N. P., Kasarda J. D. Enterprise logistics and supply chain structure: the role of fit, Journal of Operations Management, 2000, 18, pp. 531-547.
6. Kosenko O. V., Pushnina I. V. Model' upravlenija na osnove reshenija nesimmetrichnyh transportnyh zadach, Izvestija Juzhnogo federal'nogo universiteta. Tehnicheskie nauki, 2013, No. 2 (139), pp. 175-180.
7. Raskin L. G., Kirichenko I. O. Mnogoindeksnye zadachi linejnogo programmirovanija (teorija, metody, prilozhenija). Moscow, Radio i svjaz', 1982, 240 p.
8. Dunaevskaja O. I., Raskin L. G. Zadacha transportnoj logistiki so sluchajnoj stoimost'ju perevozok, Vestnik Har'kovskogo nacional'nogo avtomobil'no-dorozhnogo universiteta, 2007, No. 37, pp. 87-89.
9. Kosenko O. V. Povyshenie jeffektivnosti metodov reshenija mnogoindeksnyh zadach raspredelenija resursov, Izvestija JuFU. Tehnicheskie nauki, 2016, No. 4 (177), pp. 73-81.
10. Nechitajlo N. M. Transportnaja zadacha po kriteriju minimuma obshhego vremeni s uchetom poter' na promezhutochnuju
obrabotku resursov, Izvestija vysshih uchebnyh zavedenij. Severo-Kavkazskij region. Serija: estestvennye nauki, 2003, No. 3, pp. 11-14.
ll.Osykina Ju. A., Chernyshova G. D. Mnogokriterial'naja transportnaja zadacha s razryvnoj celevoj funkciej, Vestnik Voronezhskogo gosudarstvennogo universiteta. Serija: sistemnyj analiz i informacionnye tehnologii, 2008, No. 2, pp. 10-12.
12. Kotenko I. A., Shikina E. D., Turovec S. D. Transportnaja zadacha linejnogo programmirovanija na orgrafe sostojanij sistemy massovogo obsluzhivanija, Matematicheskoe modelirovanie i kraevye zadachi. Trudy decjatoj vserossijskoj nauchnoj konferencii s mezhdunarodnym uchastiem: v 3-h tomah, 2016, pp. 133135.
13. Aleksandrov A. Je., Jakushev N. V. Stohasticheskaja postanovka dinamicheskoj transportnoj zadachi s zaderzhkami s uchetom sluchajnogo razbrosa vremeni dostavki i vremeni, Upravlenie bol'shimi sistemami: sbornik trudov, 2006, Vyp. 12-13, pp. 5-14.
14. Bochkarev A. A. Teorija i metodologija processnogo podhoda k modelirovaniju i integrirovannomu planirovaniju cepi postavok: avtoref. dis. ... d-ra jekonom. nauk: 09.09.09. Sankt-Peterburg, GOU VPO «Sankt-Peterburgskij gosudarstvennyj inzhenerno-jekonomicheskij universitet», 2009, 39 p.
15. Judin D. B., Gol'shtejn E. G. Zadachi i metody linejnogo programmirovanija. Moscow, Sov. radio, 1961, 364 p.
16. Ahiezer E. B., Geljarovskaja O. A., Dunaevskaja O. I., Procaj N. T. Poluchenie nachal'nogo opornogo plana mnogoindeksnoj zadachi transportnoj logistiki, Radiojelektronika i informatika, 2014, No. 2 (65), pp. 16-18.
17. Peresvetov V V. Priblizhennoe reshenie trehindeksnyh planarnyh nelinejnyh transportnyh zadach, Vestnik TOGU. Informatika, vychislitel'naja tehnika i upravlenie, 2015, No. 2(37), pp. 113-120.
