CC BY
18
OPTIMIZATION OF MEDIA RESOURCE TRANSPORTATION
Kayumova Gulshan Asrorovna
Dr. Beknazarova Saida Safibullayevna
Tashkent University of information technologies, Tashkent, Uzbekistan ARTICLE INFO ABSTRACT
Received 13 April 2016 The modelling approaches, their setting and the search algorithm of the
Accepted 19 April 2016 optimal solutions for the tasks of linear programming of the transport
Published 30 April 2016 problem are presented in the article by formulating the baseline and checking
its optimality.
KEYWORDS
modelling approaches, media resource, freight traffic.
© 2016 The Authors.
Load must be transported from a dispatching point B to receiving points j={1,2,....,n}. The volume of transported load is given as Q j per each receiver.
l is a number of media resources which transport cargo l= . qi is lifting
capacity per each media resource k ke{1,2, ,...,l}. The numerical order of media resources l={1,2,.....,l}
is shown in such order where condition is met.
An arranged route for each media resource k is a route sequence , at
that .
It is required to arrange such a route for each media resource where total cargo volume doesn't exceed its lifting capacity, i.e.
^ Qj:<qh,kE {1,2......0 . (1)
JERk
For this purpose the following requirements must be fulfilled:
- none of pick-up sections mustn't take two routes, in other words the crossing of Rk and Rr route pick-up sections must be clear, i.e.
r * k Rk n Rr = 0, r,k 6 {1,2,....., 0 (2)
Load must be reached to all receiving installations, i.e.
U Rk = U-2......0; (3)
fce(i-^i)
The system of arranged routes must provide shortest distance:
^ dji -> MIN (4)
UOeR
With that:
R\ = { ( R, il), ,j2) ,.....(js>B) } -number of even sections on route;
44 2(4) April 2016
http://ijite. org/
R1 = {RR2,....., R■ ■ ■■ Ri } - number of even sections on all routes;
dji -elements of intersection shortest distance matrix
Setting the problem and arranging route model don't much differ from the way given before.
It should be noted that the flexible ways of routing less-than-car load transportation haven't been developed yet.
According to the method, in the first instance the master schedule for load transportation is worked out. A certain pendulum route is furnished for each receiver. A media resource with a certain lifting capacity is furnished according to the load volume.
The following three conditions should be met:
1) i* and j* sections are not included in one route;
2) depending on which route i*sections are included, they are considered to be their starting or final sections;
3) (i*, j*) cells are not blocked (i.e. they are analyzed at the previous stages of the algorithm).
If the cell which meet three conditions are found, pass to step 2. If such cell isn't found pass to
stage 6.
Step 2. If i* section is included into some route, denote it as route 1. Correspondingly, if j* section is included into another section, then it is denoted as route 2.
Let's introduce the following necessary notations:
N = {1, 2, ..., n} -number of receiving installations;
N1 (N1 c N) -number of sections included in route 1;
N2 (N2 c N) - number of sections included in route 2.
So, i* 6 N1, j* 6 N2 h N1 n N2= 0 (lcondition for step 1).
Let's compute the volume of total transport movement:
with that c -lifting capacity of a media resource, unit.
If the condition is met, pass to stage 4, if it isn't met, pass to stage 5.
Step 4. Let's unite Route 1 and Route 2 and form a generalized belt route X. Section i* is a final section of Route 1 and Section j* is a starting one of Route 2.
(5)
With that qk - k- section's demand, unit (see Tablel). Step 3. Let's check the following condition:
qi + q2 < c
(6)
http:/ijite. org/
2(4) April 2016 45
