Calculation of throughputs of intermediate centers in three-index transportation problems Текст научной статьи по специальности «Математика»

-□ □-

Розглянута транспортна задача лтш-ного програмування з промiжними центрами, коли значення пропускног здатностi промiжних центрiв не задат. Поставлена задача розрахунку рационального розподi-лу сумарног пропускног здатностi з метою мiнiмiзацiг середнього значення транспортних витрат. Запропоноват ефективш ме-тоди розв'язання цш задачi

Ключовi слова: транспортна задача с промiжними центрами, розрахунок пропускног здатностi промiжних центрiв

□-□

Рассмотрена транспортная задача линейного программирования с промежуточными центрами, когда значения пропускных способностей промежуточных центров не заданы. Поставлена задача расчета рационального распределения суммарной пропускной способности с целью минимизации среднего значения транспортных расходов. Предложены эффективные методы решения этой задачи

Ключевые слова: транспортная задача с промежуточными центрами, расчёт пропускных способностей промежуточных центров

-□ □-

1. Introduction

In practice, a problem often arises with drawing up a plan for transporting homogeneous productbi from production centers to consumption centers using vehicles of various types. Implementation of this plan would ensure minimum transportation costs. It is clear that it is impossible to solve such a problem based on the classical transport theory since in the case under consideration the cost of transporting a unit of product depends not only on the mutual location of production and consumption centers but also on the type of transport. Also, additional restrictions on the quantity of the product transported by vehicles of a given type are added to the usual transport constraints.

This problem, as shown in [1], is a three-index transport problem and is solved by the known method of potentials [1, 2]. On the other hand, when planning transportation, a situation occurs when the products are delivered to consumers not directly but through intermediate centers (warehouses, secondary processing enterprises, etc.). The problem of optimizing the transportation plan corresponding to this situation is called a transportation problem with intermediate centers. This problem, apparently, was first formulated in [3] as a general transport-type problem Then it was redefined as a multi-index transportation problem in [4], and finally, it was formulated as a transportation problem with intermediate stations in [5]. Necessity of taking into account intermediate centers and possible differences in assignment of their throughputs make the task nontrivial. In this case, nature of distribution of the overall throughput

© L

UDC 517.8

|DOI: 10.15587/1729-4061.2017.103950]

of the system of intermediate centers significantly affects magnitude of total transportation costs. This circumstance determines urgency of the problem.

2. Literature review and problem statement

Let us consider the known approaches to this problem solution. The model of this problem has the following form. Introduce the following notation:

i e I = {1,2,...,m} : the numbers of product manufacturers; j e J = {1,2,...,n}: the numbers of product consumers; k e K = {1,2,...,r}: the numbers of intermediate centers; Cik: the average cost of transporting a unit of product from the i-th producer to the k-th intermediate center;

Cjk: the average cost of transporting a unit of product from the k-th intermediate center to the j-th consumption center;

Xik: the planned volume of transportation from the i-th producer to the k-th intermediate center;

Xkj: the planned volume of transportation from the k-th intermediate center to the j-th consumption center;

ai: the total volume of products intended for transportation from the i-th production center, ieI;

dk: the permissible volume of transportation through the k-th intermediate center, keK;

bj: demand for products at j-th consumption center, jeJ. In this notation, the problem of rational organization of transportation is formulated as follows: find sets {Xik}, {Xkj} minimizing the total average cost of transportation

CALCULATION OF THROUGHPUTS OF INTERMEDIATE CENTERS IN THREE-INDEX TRANSPORTATION PROBLEMS

L. Raskin

Doctor of Technical Sciences, Professor, Head of Department* O. Sira

Doctor of Technical Sciences, Professor* Е-mail: topology@ukr.net V. Karpen ko

Lecturer* E-mail: ncdiplom@gmail.com *Department of Computer Monitoring and Logistics National Technical University "Kharkiv Polytechnic Institute" Kyrpychova str., 2, Kharkiv, Ukraine, 61002

R=EEcÄ+ZZCkJXk i=1 k=1 k=1 j=1

and satisfying the following constraints:

]TXik = ai, Xik >0, iel, keK;

k=1

]TXkj = bj,Xkj>0, je J,keK;

E Xik = E Xkj< dk,k eK. i=1 j=1

(1)

EEXikj = ^ i e1,

k=1 j=1

(2)

(3)

(4)

E ai = E dk = E bj= d,

i=1 k=1 j=1

(5)

then the initial problem is divided into two independent subproblems:

a) find a set {Xik}, minimizing

R1=EEcx

i=1 k=1

and satisfying constraints (2) and also

EXik = dk, k = 1,2,...,r;

i=1

b) find a set {Xkj}, minimizing

r2=EECkjXkj

k=1 j=1

and satisfying constraints (3) and also

E Xkj = dk, j = 1,2, ...,n.

j=1

(6)

(7)

(8)

(9)

The canonical formulation of problem (1)-(5) leads to the three-index problem in the following way [1], [4-6]. Introduce

Xikj: the planned volume of traffic from the i-th producer to the j-th consumption center through the k-th intermediate center;

Cikj=Cik+Ckj: the total average cost of transporting a unit of product from the i-th producer to the j-th consumption center thru the k-th intermediate center.

In this case, the problem reduces to finding a set {Xikj}, minimizing

R =EEECikjXikj

i=1 k=1 j=1

and satisfying constraints:

(10)

EE Xikj < dk,k eK, i=1 j=1

E EEXikj = bj j e J,

i=1 k=1

XiW> 0, i el, k eK, j e J.

(11)

(12)

(13)

(14)

Fulfillment of conditions (2)-(4) ensures taking out of all products, full satisfaction of consumer demand and absence of accumulation of products, which were not taken out from intermediate centers.

Constraints (4) are system-organizing constraints. At the same time, if the volume of traffic through intermediate centers is not limited, then, as it will be shown, the formulated problem is reduced to a three-index transportation problem. On the other hand, if the set {dk} is given, and

The obtained problem is a three-index triplanar transportation problem.

For the exact solution of the obtained problem (10)-(14), the method of potentials [1, 2] is used. The solution process consists of a preliminary stage and a finite number of similar iterations constituting the main stage of the algorithm work [1, 7-10]. At the preliminary stage, initial reference plan is determined. One of the known methods is used, for example, the method of sequential distribution. Each iteration of the main stage consists of two steps. At the first step, optimality of the reference plan obtained in the previous iteration (or at the preliminary stage) is determined. If the plan is optimal, then the solution process ends. Otherwise, the second iteration step is performed in which a new reference plan is obtained which is closer to the optimal one.

The main drawback of this method is that the complexity of the computational procedure for solving triplanar problems by this method grows very rapidly with increase in the problem dimensionality. For real values of m, n, r, the number of variables in the problem is of the order 106 and the number of constraints is (102-103). In this case, the problem dimensionality determined by the product of the number of variables by the number of constraints is of the order 108-109.

Approximate methods for solving this problem are described in [1, 10-14]. The need to develop fairly simple approximate methods for solving transportation problems is due to the following circumstances. First, numerical values of the parameters of real transportation problems, as a rule, are not accurate due to random errors in their measurement and estimation and due to the possible inadequacy of the linear model. Besides, the model inaccuracies can result from the influence of unaccounted factors. In a situation where initial data of the problem are random variables, the transportation plan obtained as a result of an exact solution for these data may appear to be not optimal. Secondly, laboriousness of solving multidimensional transportation problems by exact methods grows very rapidly with increase in their dimensionality. In this case, dimensionality of many real problems is so great that it is impossible to obtain their exact solution in an acceptable time even with the use of modern computing machinery.

Note that all of the above should not be understood in such a way that approximate methods are intended just for manual problem solution. An effective approximate algorithm, as a rule, allows one to obtain a reference plan close to optimal one and therefore can be used at the initial stage of work of the exact algorithm in machine solution significantly reducing total time for obtaining the result.

Approximate methods of solving the triplanar transport problem considered in [1] are based on an effective choice of the leading index element in the transportation costs matrix. The simplest of them is the method of the minimal element in the section. The method is a modification of the method of sequential distribution to construct an initial reference

plan. In this case, the section in which the leading element is sought can be one-dimensional (the method of the minimum element in a row, column), two-dimensional or even three-dimensional.

In the well-known formulations of the transportation problem with intermediate centers, two variants of formulation of constraints (4) are considered for which constraints (5) are fulfilled [9-13] or not fulfilled [14-16]. A natural complicating generalization of the original problem arises if the set {dk} was not specified but its components must satisfy the constraints (5) for all admissible plans {Xikj}.

3. The aim and objectives of the study

The study objective was to develop a method for solving a transportation problem with intermediate centers with unspecified throughputs.

In accordance with this objective, the study tasks were formulated:

- development of a multi-step iterative procedure for calculating throughputs of intermediate centers;

- development of a one-step procedure for direct calculation of throughputs.

4. Materials and methods of research. Development of a method for calculating throughput of intermediate centers

d0 d1 d2 ... d2 j = do d2 di ••• d2

d0 d2 d2 ... d1

A certain admissible distribution of the volume values {d(kj)}, j=1, 2,..., r+1, for the intermediate centers corresponds to each column of this matrix. Solutions of a pair of transportation problems: T1 - {(6), (2), (7)} and T2 - {(8), (3), (9)}, determining the value of the total cost of transportation (17) correspond to this distribution. Specify initial distributions as follows:

A d do =-, r

d

d1=—(vm+r -1), d2

rJr+1 \ '

Next, assign coordinates of some point in a r-dimensional quotient space to the elements of each column of matrix I. These points define vertices of a convex polyhedron.

Parameters d0, dj, d2 are chosen so that the sum of the admissible volume values corresponding to each column of the matrix I is equal to the total volume of the transported product and the distances between the polyhedron vertices are equal to each other.

Indeed,

Let values of the components of the sets {ai}, {bj}, {Qk}, d1 + (r - 1)d2 = -—-[VT+1 + r -1+(r - 1)VT71 - (r -1)] =

{Ckj}, ieI, jeJ, keK are specified. It is required to find a set {dk}, keK, the use of which in task (6)-(9) provides a minimum average transportation cost. The possible approach to finding a set is as follows.

Introduce an arbitrary set {di, d2,..., dr} of admissible volume values for intermediate centers with their components satisfying the constraints

r(r +1)

= d,

R ({dkj)}, |dij2)}]^V2 (d1 - d2 ) =

j1 = 1,2,...,r, j2 = 2,3,...,r +1.

V2VÎ+T

I dk = I a, = I ^

k=1 i=1 j=1

dk >0, k = 1,2,...,r .

(15)

(16)

Next, solve the problem of finding the transportation plans in the statement (6)-(9). Let {X*k}, {Xkj} is the corresponding optimal plan which corresponds to the value of the total cost of transportation equal to

r*=llcikx;

-I!«.

k=1 j=1

(17)

It is clear that by enumerating for {dj, d2,..., dr} and taking into account (15), (16), one can find a set of admissible volumes of intermediate centers for which value R* will be minimal.

This path is ineffective since the number of enumerations increases rapidly with increase in the number of intermediate centers and tightening of the requirements for accuracy of the solution obtained. In this connection, consider an optimization procedure that constructively leads to the desired set {dk}.

Use the Nelder-Mead method. Introduce matrix I dimI= =rx(r+1), of the form:

The optimized objective function of the problem is determined by expression (17) the value of which is calculated from the results obtained in solving problems (6), (2), (7) and (8), (3), (9).

Block diagram of the problem solution is shown in Fig. 1.

The problem solution results in a set {dk}, Its use ensures obtaining of optimal plans of transportation from producers to intermediate centers (plan {X*k}) and from intermediate centers to consumers (plan {X*kj}).

The proposed technique for solving the problem of rational organization of transportation from suppliers to consumers through a system of intermediate centers can be effectively used in problems of low dimensionality. The central part of this technique is the Nelder-Mead algorithm which includes an independent solution of 2(r+1) transport problems (r is the number of intermediate centers) in each step. This circumstance combined with the extremely slow convergence of the optimization procedure, which is inherent to the Nelder-Mead method leads to a catastrophically rapid increase in total time for solving the problem.

Reduction of this time can be achieved using the approach based on the theory of duality. As in any linear programming problem, dual problems correspond to the above problems T1 - {(6), (2), (7)} and T2 - {(8), (3), (9)} [2, 17].

d

t ¿c/kj=idkZk+£bjW/. (23)

k=1 j=1 k=1 j=1

Besides, the following correlations are fulfilled for the optimal plans of the formulated dual problems,

U* + Vk < Cik, i = 1,2,..,m, k = 1,2,...,r, (24) U* + Vk = Cs, if xik >0, (25)

R((() + Rf

| Yes

{d'k},{X'ik }

In this case, the problem conjugate to T has the following form: find sets {Ui}, {Vk}, i=1, 2,..., m, k=1, 2,..., r, that maximize the function

L1(U,V) = ttaiUi + ^dkVk (18)

i=1 k=1

and satisfy constraints

Ui + Vk < Cik, i = 1,2,..,m, k = 1,2,...,r. (19)

The following problem corresponds to the problem T2: find sets {Zk}, {Wj}, k=1, 2,..., r, j=1, 2,..., n, that maximize the function

L2(Z,W) = ^dkZk + ^bjWj (20)

k=1 j=1

and satisfy the constraints

Zk + Wj < Ckj, k = 1,2,..,r, j = 1,2,...,n. (21)

The dual problems (18), (19) and (20), (21) always have a solution. Moreover, if X1 = {x*k}, {U*}, {Vk} are the optimal plans of problems (6), (2), (7) and (18), (19), then

ICAk = £aiU* + £dkVk. (22)

i=1 i=1 k=1

Similarly, if X2 = {xkj}, {Z*k}, {Wj*} are the optimal plans of problems (8), (3), (9) and (20), (21), then

Zk + Wj* < Cy, k = 1,2,..,r, j = 1,2,...,n, (26)

Z*k + Wj* = Ckj, if x*y >0. (27)

It follows that solutions of direct problems can be obtained from solution of dual problems. Indeed, let {U*}, {Vk} be solution of the dual problem. Substitute this solution in (24) and find sets I = {i*} and K = {k*}, for which inequalities (24) are fulfilled as equalities. Then, in accordance with (25), these sets uniquely determine the set {Xi*k*} the components of which are positive and determine solution of the direct problem (6), (2), (7). A similar operation is performed with a set {Zk}, {Wj*}.

The iterative procedure for finding D vector using the Nelder-Mead method is organized as follows. An array of sets {d(k1)}, {d(k2)},...,{d(kr+1)} is formed each of which contains r components, A air of problems (6), (2), (7) and (8), (3), (9) is solved for each set {d^s)}.

Effectiveness of the plan corresponding to the set {d^s)} is estimated by the sum

R(s) = 2>A+£dis)Vk+^dis)Zk+£bjWj.

i=1 k=1 k=1 j=1

Next, the step of the Nelder-Meade procedure is performed.

This option is better than the previous one for the following reasons.

1. Dimensionalities of the dual problems (18)-(19) and (20)-(21) are smaller than those of the corresponding direct problems with respect to the number of variables, e. g. m+k<mk, k+n<kn.

2. Problems (18)-(19) and (20)-(21) are one-index unlike the two-index problems (6), (2), (7) and (8), (3), (9).

3. The techniques for solving dual problems are simpler than the corresponding techniques for direct problems since they are solved by the ordinary simplex method in one stage. Direct problems are structurally more complex since they contain an unpredictable number of iterations, each iteration solving the problem of forming a plan and its improvement.

Finally, consider another, seemingly most effective, approach to solving the problem of finding a rational set of throughputs of intermediate centers.

The idea of the proposed technique is as follows. The cheapest route (i-k-j) is sought for each pair (i-th supplier -j-th consumer). As a result, an ordinary two-index transportation problem of delivering products from the supplier system to the consumer system arises. Solution of this problem contains an optimal set of transportation volumes in this

R

(2)

R(2) + R

(2)

Forming new sets {dk}

(the step of the Nelder-Mead method)

Fig. 1. Block diagram of the problem solution

system. Now it only remains to totalize for each intermediate center the volumes of supplies passing through this center.

Describe the procedure for obtaining solution in more detail.

Step: There are the following matrices

C1=(cik): the cost of transporting a product unit from suppliers to intermediate centers,

C2=(ckj): the cost of transporting a product unit from the intermediate centers to consumers.

To find routes requiring minimum delivery costs, introduce a special operation of matrix "multiplication". Perform operation of "multiplication" for two square matrices A and B of the same dimensionality applying the rule:

C = A ® B,

c,j = min(c,1 + cij ,ci2 + c2j,...,c,n + cnj) = c,k,jj = c,j. (28)

Here

kij= argmkinicik + ckj}. (29)

c^ minimum cost of delivery of a product unit from the i-th supplier to the j-th consumer.

To each pair (i, j), correlation (29) assigns number of the kij, station thru which it is expedient to make deliveries from i to j. This correspondence is defined by formula

S(ij)=kij.

As a result, usual two-index transportation problem is obtained: find a set X=(xij), that minimizes the total transportation cost

Set a1 = 20, a2 = 30, b = 16, b2 = 24, b3 = 10. The balance condition is fulfilled:

ta, =tbj= 5°.

i=i j=i

Diagrammatic representation of the corresponding transportation system together with intermediate centers is shown in Fig. 2.

Fig. 2. Graphic model of a transportation system

Introduce matrix of costs of transportation from suppliers to intermediate centers and further to consumers:

L(X)=tt j

i=1 j=1

and satisfies the constraints

tj a„ i = 1,2,...,m, (31)

j=1

tj bj, j = 1,2,...,n, (32)

i=1

xij> 0, i = 1,2,...,m, j = 1,2,...,n. (33)

(30)

1 2 3 4 5 6 7 8

1 0 < 3 6 4 < < <

2 < 0 5 3 8 < < <

3 < < 0 < < 6 4 5

4 < < < 0 < 2 7 6

5 < < < < 0 6 5 2

6 < < < < < 0 < <

7 < < < < < < 0 <

8 < < < < < < < 0

In this matrix, station pairs marked with symbol ot, are the stations for which direct transition is impossible.

Now, use (28) to calculate matrix C = (j of minimum costs of transportation from suppliers to consumers:

C = C ® C =

1 2

Let X* = (x*j) be solution of problem (30)-(33). 3 Next, introduce the following set for each = 4 intermediate center k:

Mk = {(i,j):x*j > 0, S(i,j) = j

(34)

Then, for each kij, calculate the total volume of cargo transported through this intermediate center when implementing the plan X*:

dk = t xj k = 1,2,...,r.

(ij)eMk

(35)

The resulting set determines rational values of throughputs of the intermediate centers.

Example.

Consider a system consisting of two production centers, three of consumption centers and three intermediate centers.

= 4

1 2 3 4 5

0 < 3 6 4

< 0 5 3 8

< < 0 < <

< < < 0 <

< < < < 0

< < < < <

< < < < <

< < < < <

1 2 3 4 5

0 < 3 6 4

< 0 5 3 8

< < 0 < <

< < < 0 <

< < < < 0

< < < < <

< < < < <

< < < < <

1 2 3 4 5 6 7 8

1 0 < 3 6 4 < < <

2 < 0 5 3 8 < < <

3 < < 0 < < 6 4 5

4 < < < 0 < 2 7 6

5 < < < < 0 6 5 2

6 < < < < < 0 < <

7 < < < < < < 0 <

8 < < < < < < < 0

6

6

7

8

6

5

6

2

k16 = 4 k17 = 3 k18 = 5 k26 = 4 k27 = 3 k28 = 4.

This matrix elements determining minimum cost of transporting a unit of cargo from suppliers to consumers also contain (in the bottom left corner) the number of the intermediate center thru which corresponding best route passes.

The following is two examples of calculating the matrix elements:

d5 = £ j X18 =10.

(¡j)eM5

Solution is over.

5. Discussion of results of development of calculation

methods. Estimation of effectiveness of the proposed

methods for distribution of the intermediate center

throughputs

c16 = min{c11 + c16, c12 + c26' c13 + c36' c14 + + c46' c15 + c56' c16 + c66' c17 + c76' c18 + c86} =

= min{~, ~,3 + 6,6 + 2,4 + 6, = = min{9,8,10} = 8, k16 = 4,

c17 = min{c11 + C17, c12 + C27, c13 + ^ c14 + +c47, c15 + c57, c16 + c67, c17 + c77, c18 + c87} =

= min{~, 3 + 4,6 + 7,4 + 5, »} = = min{7,13,9} = 7, k17 = 3.

In the obtained matrix C, a submatrix C0 containing minimum transportation costs from suppliers to consumers taking into account intermediate centers is of interest for further solution:

C = 1

6 7 8

1 48 37 56

2 45 39 49

Now the problem is reduced to finding a set X=(xij), i=1, 2, j=6, 7, 8, minimizing

l(x)=£ £ j

i=1 j=6

and satisfying the constraints

£ j 20, £ x^= 30,

j=6 j=6

= 16, £^7 = 24, £Xi8 = 10.

Solution of this priblem:

( 0 10 10' = i16 14 0

Thus, a transportation problem with a system of producers, consumers and intermediate centers the throughputs of which was not specified has been set and solved.

At the same time, in accordance with the study tasks, two alternative approaches were proposed for constructing a procedure for calculating throughputs of intermediate centers. The first approach uses the iterative Nelder-Mead method. A set of ordinary two-index transportation problems is solved in each step of this method. The second approach is based on a preliminary finding of the shortest routes for each supplier-consumer pair. Realization of this idea allowed authors to reduce this problem to a common two-index problem.

Comparison of effectiveness of the proposed methods for calculating rational values of throughput of the intermediate centers convincingly demonstrates advantages of the second approach. It is easier to implement and it has significantly faster performance. However, its most important advantage is the possibility of extending this approach to the case where the system of intermediate centers contains not one but several intermediate layers. The obtained results can be directly used in the practice of large enterprises implementing a closed cycle of the production process (production of products - delivery of products to points of sale - consumption of products).

The expedient direction of further studies consists in taking into account real uncertainty in estimating transportation costs. This problem was first formulated in [18] and almost simultaneously in [19] for a simple case when the random cost values are distributed according to the normal law. More adequate possibilities for specifying uncertainty are associated with the use of fuzzy mathematics [20, 21] as well as imprecise mathematics [22, 23]. Finally, another variant of uncertainty arises if the random costs of transportation are specified by the values of their mathematical expectations and variances. The way to overcome the problem in this case is to find the worst density of the cost distribution [24] and a minimax solution of the problem.

Use this solution to calculate values of throughput of intermediate centers using formulas (34), (35).

M3 ={(1,7),(2,7)},

M4 ={ (2,6)},

M5 ={(1,8)}.

d3 = £ xij= x17 + x27 = 24,

(ij)eMe

d4 = £ xij= x26 = 16,

(ij)eM4

6. Conclusions

1. An iterative procedure was proposed for calculating rational values of throughput of intermediate centers. The method provides an accurate solution of the problem which minimizes total costs. A feature of this procedure is application of the decomposition principle which allows the original three-index problem to be reduced to a set of ordinary two-index problems.

2. A method has been developed for direct calculation of distribution of throughput. It is based on a preliminary search for the shortest routes for each supplier-consumer pair. The method can be used to solve transportation problems with several layers of intermediate centers.

References

1. Raskin, L. G. Mnogoindeksnye zadachi lineynogo programmirovaniya [Text] / L. G. Raskin, I. O. Kirichenko. - Moscow: Radio i svyaz', 1982. - 240 p.

2. Gol'shteyn, E. G. Zadachi lineynogo programmirovaniya transportnogo tipa [Text] / E. G. Gol'shteyn, D. B. Yudin. - Moscow: Nauka, 1969. - 482 p.

3. Halley, K. B. The solid transportation problem [Text] / K. B. Halley // Operations Research. - 1962. - Vol. 10, Issue 4. - P. 448-463.

4. Corban, A. A multidimensional transportation problem [Text] / A. Corban // Revue Roum. Mat. Appl. - 1964. - Vol. 9, Issue 8. -P. 14-27.

5. Corban, A. Transportation problem with intermediate centers [Text] / A. Corban // Rev. Roum. Mat. Pures Appl. - 1971. -Vol. 16, Issue 9.

6. Corban, A. Modelul tridimensional de transport cu capacitate [Text] / A. Corban // Stud. Cerc. Mat. - 1971. - Vol. 23, Issue 9. -P. 99-106.

7. Seraya, O. V. Mnogomernye modeli logistiki v usloviyah neopredelennosti [Text] / O. V. Seraya. - Kharkiv: FOP Stecenko I. I., 2010. - 512 p.

8. Cerhes, M. Programe tridimensionala [Text] / M. Cerhes. - Bucuresti: Ed. Tehn., 1970. - 268 p.

9. Kundu, P. Multi-objective solid transportation problems with budget constraint in uncertain environment [Text] / P. Kundu, S. Kar, M. Maiti // International Journal of Systems Science. - 2013. - Vol. 45, Issue 8. - P. 1668-1682. doi: 10.1080/00207721.2012.748944

10. Kundu, P. Multi-objective multi-item solid transportation problem in fuzzy environment [Text] / P. Kundu, S. Kar, M. Maiti // Applied Mathematical Modelling. - 2013. - Vol. 37, Issue 4. - P. 2028-2038. doi: 10.1016/j.apm.2012.04.026

11. Mahapatra, D. R. Multi-choice stochastic transportation problem involving extreme value distribution [Text] / D. R. Mahapatra, S. K. Roy, M. P. Biswal // Applied Mathematical Modelling. - 2013. - Vol. 37, Issue 4. - P. 2230-2240. doi: 10.1016/j.apm. 2012.04.024

12. Giri, P. K. Fully fuzzy fixed charge multi-item solid transportation problem [Text] / P. K. Giri, M. K. Maiti, M. Maiti // Applied Soft Computing. - 2015. - Vol. 27. - P. 77-91. doi: 10.1016/j.asoc.2014.10.003

13. Motzkin, T. S. The multi-index transportation problem [Text] / T. S. Motzkin // Bull. Amer. Mat. Soc. - 1982. - Vol. 58, Issue 4.

14. Smith, G. Technical Note - Further Necessary Conditions for the Existence of a Solution to the Multi-Index Problem [Text] / G. Smith // Operations Research. - 1973. - Vol. 21, Issue 1. - P. 380-386. doi: 10.1287/opre.21.1.380

15. Stoynova-Pen'kova, N. Trindeksna transportna zadacha [Text] / N. Stoynova-Pen'kova. - Sofiya: Tr. Vyssh. Ekonom. In-t, 1970. - P. 70-78.

16. Pierskalla, W. P. Letter to the Editor - The Multidimensional Assignment Problem [Text] / W. P. Pierskalla // Operations Research. - 1968. - Vol. 16, Issue 2. - P. 422-431. doi: 10.1287/opre.16.2.422

17. Raskin, L. G. Matematicheskie metody issledovaniya operaciy i analiza slozhnyh sistem vooruzheniya PVO [Text] / L. G. Raskin. - Kharkiv: VIRTA, 1988. - 177 p.

18. Williams, A. C. A Stochastic Transportation Problem [Text] / A. C. Williams // Operations Research. - 1963. - Vol. 11, Issue 5. -P. 759-770. doi: 10.1287/opre.11.5.759

19. Szwarc, W. The Transportation Problem with Stochastic Demand [Text] / W. Szwarc // Management Science. - 1964. -Vol. 11, Issue 1. - P. 33-50. doi: 10.1287/mnsc.11.1.33

20. Raskin, L. G. Nechetkaya matematika [Text] / L. G. Raskin, O. V. Seraya. - Kharkiv: Parus, 2008. - 352 p.

21. Raskin, L. Method of solving fuzzy problems of mathematical programming [Text] / L. Raskin, O. Sira // Eastern-European Journal of Enterprise Technologies. - 2016. - Vol. 5, Issue 4 (83). - P. 23-28. doi: 10.15587/1729-4061.2016.81292

22. Pawlak, Z. Rough sets [Text] / Z. Pawlak // International Journal of Information and Computer Sciences. - 1982. - Vol. 11, Issue 5. - P. 341-356.

23. Raskin, L. Fuzzy models of rough mathematics [Text] / L. Raskin, O. Sira // Eastern-European Journal of Enterprise Technologies. -2016. - Vol. 6, Issue 4 (84). - P. 53-60. doi: 10.15587/1729-4061.2016.86739

24. Raskin, L. G. Kontinual'noe lineynoe programmirovanie [Text] / L. G. Raskin, I. O. Kirichenko. - Kharkiv: VIVV, 2005. - 175 p.