Explorați Cărți electronice
Categorii
Explorați Cărți audio
Categorii
Explorați Reviste
Categorii
Explorați Documente
Categorii
Facultatea de Transporturi
Proiect
Logistica Transporturilor
-Proiectarea unui sistem de distributie depozit – clienti-
An de studiu: Master II
Bucuresti
2018
Sa se studieze un sistem de distributie de la un depozit (D) central la 7 clienti (P1,P2, ...P7
repartizati conform hartii) care are urmatoarele caracteristici:
c. Depozitul functioneaza 7 zile pe saptamana si are un dispecerat care inregistreaza
zilnic cererile clientilor;
Luni
Pentru deservirea clientilor sunt necesare 2 vehicule. Astfel pentru servirea optima a celor 5
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
Vehicul 1 ( P1,P2 ):
D P1 P2
-
D ∞ 8700 15400 r1= 23500
8700
-
P1 13400 ∞ 6400
6400
-
P2 15600 8400 ∞
8400
D P1 P2
D ∞ 0 6700
P1 7000 ∞ 0
P2 7200 0 ∞ r2= 7000
-
7000
ω0= r1 + r2 = 30500
Ɵ1=w0+p1= 37200
D P1 P2 ̅̅̅̅̅̅)=6700
=>p1(𝐷𝑃1
D ∞ 0(6700) 6700
Se impune conditia C(P1D)= ∞
P1 0(200) ∞ 0(6700)
P2 200 0(200) ∞
D P2
P1 ∞ 0 =>r3=200
P2 200 ∞
-200
R4=0 => Ɵ2=w0+r3=30700
D P2
P1 ∞ 0
P2 0 ∞
̅̅̅̅̅̅̅)= Ɵ4(P1P2)= Ɵ5(𝑃2𝐷
Ɵ3(𝑃1𝑃2 ̅̅̅̅̅̅ )= Ɵ6(P2D)= Ɵ2
R= D->P1-P2-D= 30700
P1 P2
ω0
30500
(𝑃2, 𝐷) (P2,D)
θ5 θ6
Vehicul 2:
D P4 P5 P7 r1=28400
D ∞ 13100 20300 18900 -13100
P4 13100 ∞ 7600 5900 -5900
P5 19200 8300 ∞ 4200 -4200
P7 19500 7100 5200 ∞ -5200
D P4 P5 P7
D ∞ 0 7200 5800
r2=7200
P4 7200 ∞ 1700 0
P5 15000 4100 ∞ 0
P7 14300 1900 0 ∞
-7200
ω0= r1+r2=35600
D P4 P5 P7 ̅̅̅̅̅̅)=7700
p1(𝐷𝑃4
D ∞ 0(1900+5800) 7200 5800
̅̅̅̅̅̅)W0 + p1= 43300
Ɵ1(𝐷𝑃4
P4 0 ∞ 1700 0(0)
P5 7800 4100 ∞ 0(4100) C(P4D)= ∞
P7 7100 1900 0(1700+1900) ∞
D P5 P7 r3=0
P4 ∞ 1700 0
r4=7100
P5 7800 ∞ 0
P7 7100 0 ∞ Ɵ2(DP4)=w0+r3+r4=42700
-7100
D P5 P7 ̅̅̅̅̅̅̅)=1700
p2(𝑃4𝑃7
P4 ∞ 1700 0(1700)
̅̅̅̅̅̅̅)= Ɵ2 + P2=44400
Ɵ3(𝑃4𝑃7
P5 700 ∞ 0(700)
P7 0(700) 0(1700) ∞ C(P7P4)= ∞
C(P7D)= ∞
D P5 r5=700
700 ∞ -
P5 700 r6=0
∞ 0 Ɵ4= Ɵ2+r5=43400
P7
D P5
0 ∞
P5
∞ 0
P7
R=D->P4->P7->P5->D=43400
D P4
P5 P7
ω0
35600
(P5,D)
(𝑃5, 𝐷)
θ5=43400 θ6 =43400
nP2 = 19 europalete
nP1 = 19 europalete
nP5 = 11 europalete
nP4 = 11 europalete
nP7 = 19 europalete
Ttotal circuit 1 = 38*2+13.4/0,25+19*2+5.9/0,25 + 19*2 + 15.4/0,25= = 290.8= 4.84 ore.
35
D
30
Dinstanta parcursa [km]
25
20
15
P7
10 P4
0 D
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19
Timp [h]
50
45
D
40
35
Dinstanta parcursa [km]
30
P3
25
20
15 P1
10
5
D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 30.7 + 1 ∗ 43.4 = 74.1 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (30.7 − 15.4) + 1 ∗ (43.4 − 15.2) = 43.5 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
Procentul parcursului gol:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.4
𝑃𝑔 𝑣𝑒ℎ 1 = ∗ 100 = 48.8 %
30.7
15.2
𝑃𝑔 𝑣𝑒ℎ 2 = ∗ 100 = 34.5 %
43.4
𝑃𝑔 𝑚𝑒𝑑 = 41.6 %
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 1 = 9800 ∗ 13.4 + 4900 ∗ 6.4 = 162680 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 2 = 7800 ∗ 13.1 + 3900 ∗ 5.9 + 4900 ∗ 5.2 = 150670 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑚𝑒𝑑 = 156675 𝑘𝑔 ∗
𝑧𝑖
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
162680 150670
𝐺î𝑛𝑐 = ( + ) ∗ 100 = 49 %
17600 ∗ 30.7 17600 ∗ 43.4
Marti
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 3
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P2 P3 P5 r1=29100
D ∞ 15400 15100 20300 -15100
P2 15600 ∞ 7400 4300 -4300
P3 15100 7900 ∞ 7200 -7200
P5 19200 2500 7700 ∞ -2500
D P2 P3 P5 r2=7900
D ∞ 300 0 5200
P2 11300 ∞ 3100 0
P3 7900 700 ∞ 0
P5 16700 0 5200 ∞
-7900
w0=r1+r2=37000
D P2 P3 P5 ̅̅̅̅̅̅)=5500
P1(𝐷𝑃3
D ∞ 300 0(300+5200) 5200
P2 3400 ∞ 3100 0(3100) Ɵ1=wo+p1=42500
P3 0 700 ∞ 0 C(P3D)= ∞
P5 8800 0 5200 ∞
D P2 P5 R3=0
P2 3400 ∞ 0
R4=3400
P3 ∞ 700 0
P5 8800 0 ∞ Ɵ2(DP3)=w0+r4=40400
-3400
D P2 P5 ̅̅̅̅̅̅̅)6100
P2(𝑃5𝑃2
P2 0(5400) ∞ 0(0)
P3 ∞ 700 0(700) Ɵ3= Ɵ2+p2=46500
P5 5400 0(700+5400) ∞ C(P2P5)= ∞
D P5 Ɵ4(𝑃2𝐷 ̅̅̅̅̅̅̅)= Ɵ7(P3P5)= Ɵ2=40400
̅̅̅̅̅̅ )= Ɵ5(P2D)= Ɵ6(𝑃3𝑃5
P2 0 ∞
P3 ∞ 0 R=D->P3->P5->P2->D=40400
D P2
P5 P3
ω0
37000
(𝑃5𝑃2) (P5,P2)
θ3=46500 θ4=40400
(𝑃2, 𝐷) (P2,D)
θ5=40400 θ6 =40400
nP2 = 19 europalete
nP3 = 11 europalete
nP5 = 11 europalete
Ttotal circuit = 2*41+15.1/0,25 + 19*2 + 7.5/0,25 + 11*2 + 2.5/0,25 + 11*2 + 15.6/0,25 = 326,8
minute = 5,44 ore.
45
D
40
D
35
Dinstanta parcursa [km]
30
25
20
P5
15 P3
10
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 40.4 = 40.4 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (40.4 − 15.6) = 25,1 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
Procentul parcursului gol:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.6
𝑃𝑔 = ∗ 100 = 38,2 %
40.4
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 = 12700 ∗ 15.1 + (12700 − 4900) ∗ 7.5 + (12700 − 4900 − 3900) ∗ 2.5 = 260020 𝑘𝑔 ∗
𝑧𝑖
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
260020
𝐺î𝑛𝑐 = ∗ 100 = 36,2 %
17600 ∗ 40.4
Miercuri
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 3
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P1 P3 P5
D ∞ 8700 13100 20300 -8700
R1=25700
P1 13400 ∞ 4000 9500 -4000
P3 15100 5300 ∞ 7200 -5300
P5 19200 10500 7700 ∞ -7700
D P1 P3 P5 R2=11300
D ∞ 0 6400 11600
P1 9400 ∞ 0 5500
P3 9800 0 ∞ 1900
P5 11500 2800 0 ∞
-9400 -1900
W0=r1+r2=37000
D P1 P3 P5 ̅̅̅̅̅̅)=6400
P1(𝐷𝑃1
D ∞ 0(6400) 6400 9700
̅̅̅̅̅̅)=w0+p1=43400
Ɵ1(𝐷𝑃1
P1 0(400) ∞ 0(0) 3600
P3 400 0(0) ∞ 0(3600) C(P1D)= ∞
P5 2100 2800 0(2100) ∞
D P3 P5 R3=0
P1 ∞ 0 3600
R4=400
P3 400 ∞ 0
P5 2100 0 ∞ Ɵ2(DP1)=w0+r4=37400
-400
D P3 P5 ̅̅̅̅̅̅̅)=3600
P2(𝑃1𝑃3
P1 ∞ 0(3600) 3600
P3 0(1700) ∞ 0(3600) Ɵ3=Ɵ2+p2=41000
P5 1700 0(1700) ∞ C(P3D)= ∞
D P5 R5=1700
P3 ∞ 0
R6=0
P5 1700 ∞
-1700
Ɵ4=Ɵ2+r5=39100
D P5 ̅̅̅̅̅̅̅)= Ɵ6(P3P5)= Ɵ7(𝑃5𝐷
Ɵ5(𝑃3𝑃5 ̅̅̅̅̅̅ )= Ɵ8(P5D)= Ɵ4=39100
P3 ∞ 0
P5 0 ∞ R=D->P1->P3->P5->D
D P1
P5 P3
ω0
37000
(𝑃3, 𝐷) (P3,D)
θ5 θ6
nP1 = 19 europalete
nP3 = 11 europalete
nP5 = 11 europalete
Vehiculul 1 D
45
D
40
35
Dinstanta parcursa [km]
30
25
20
P3
15
P1
10
5
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 39.1 = 39.1 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = ∑ 𝑛𝑖 ∗ (𝑑𝑖 ∗ 𝑑𝑖∗ )
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (39.1 − 19.2) = 19.9 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
19.2
𝑃𝑔 = ∗ 100 = 49,1 %
39.1
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 = 12700 ∗ 8,7 + (12700 − 4900) ∗ 4 + (12700 − 4900 − 3900) ∗ 7.2 = 169770 𝑘𝑔 ∗
𝑧𝑖
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
169770
𝐺î𝑛𝑐 = ∗ 100 = 24,6
17600 ∗ 39.1
Joi
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 4
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P1 P2 P4 P6
D ∞ 8700 15400 13100 26100 -8700
P1 13400 ∞ 6400 6300 15300 -6300
P2 15600 8400 ∞ 5600 10800 -5600
P4 13100 8100 7500 ∞ 13300 -7500
P6 29600 16100 11300 13700 ∞ -11300
R1=39400
D P1 P2 P4 P6
D ∞ 0 6700 4400 17400
P1 7100 ∞ 100 0 9000
P2 10000 2800 ∞ 0 5200
P4 5600 600 0 ∞ 5800
P6 18300 4800 0 2400 ∞
-5600 -5200
R2=10800
W0=R1+R2=50200
D P1 P2 P4 P6
D ∞ 0(4400+600) 6700 4400 12200
P1 1500 ∞ 100 0(100+4400) 3800
P2 4400 2800 ∞ 0(0) 0(600)
P4 0(1500) 600 0(0) ∞ 600
P6 12700 4800 0(2400) 2400 ∞
̅̅̅̅̅̅)=5000
P1(𝐷𝑃1
Ɵ1=w0+p1=55200
C(P1D)= ∞
D P2 P4 P6
P1 ∞ 100 0(100) 3800
P2 4400 ∞ 0(0) 0(600)
P4 0(4400) 0(0) ∞ 600
P6 12700 0(2400) 2400 ∞
R3=0
R4=0
Ɵ2(DP1)=w0+r3+r4=55200
̅̅̅̅̅̅)=4400
P2(𝑃4𝐷
̅̅̅̅̅̅ )=Ɵ2+p2=59600
Ɵ3(𝑃4𝐷
C(P1P4)= ∞
P2 P4 P6
P1 100 ∞ 3800 -100
P2 ∞ 0 0
P6 0 2400 ∞
R5=100
R6=0
Ɵ4=Ɵ2+r5=55300
P2 P4 P6
P1 0(3700) ∞ 3700
P2 ∞ 0(2400) 0(3700)
P6 0(2400) 2400 ∞
P3(P1P2)=3700
Ɵ5=Ɵ4+p3=59000
C(P2P4)= ∞
P4 P6 R7=2400
P2 ∞ 0
Ɵ6=Ɵ4+r7=57700
P6 2400 ∞ -2400
P4 P6 Ɵ7(P2P6)=Ɵ8(P2P6)=Ɵ9(P6P4)=Ɵ10(P6P4)=Ɵ6=57700
P2 ∞ 0
R=D->P1->P2->P6->P4->D
P6 0 ∞
D P1 P2
P6 P4
ω0
50200
(𝑃4, 𝐷) (P4,D)
θ3=59600 θ4=52700
nP1 = 19 europalete
nP2 = 19 europalete
nP4 = 11 europalete
nP6= 11 europalete
Ttotal circuit = 2*52+8.7/0,25 +2*19+ 6.4/0,25+
2*19+10.8/0,25+11*2+13.7/0,25+2*11+13.1/0.25=333,32 minute = 5,55 ore.
Vehiculul 1 D
60
D
50
Dinstanta parcursa [km]
40
P6
30
20 P2
10
P1
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14 14:43 15:11
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 52.7 = 52.73 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
13.1
𝑃𝑔 = ∗ 100 = 24,5 %
52.7
Prestatia zilnica:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
410400
𝐺î𝑛𝑐 = ∗ 100 = 44.2 %
17600 ∗ 52.7
Vineri
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 4
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P1 P2 P4 P6
D ∞ 8700 15400 13100 26100 -8700
P1 13400 ∞ 6400 6300 15300 -6300
P2 15600 8400 ∞ 5600 10800 -5600
P4 13100 8100 7500 ∞ 13300 -7500
P6 29600 16100 11300 13700 ∞ -11300
R1=39400
D P1 P2 P4 P6
D ∞ 0 6700 4400 17400
P1 7100 ∞ 100 0 9000
P2 10000 2800 ∞ 0 5200
P4 5600 600 0 ∞ 5800
P6 18300 4800 0 2400 ∞
-5600 -5200
R2=10800
W0=r1+r2=50200
D P1 P2 P4 P6
D ∞ 0(600+4400) 6700 4400 12200
P1 1500 ∞ 100 0(1500) 3800
P2 4400 2800 ∞ 0(0) 0(600)
P4 0(1500) 600 0(0) ∞ 600
P6 12700 4800 0(2400) 2400 ∞
̅̅̅̅̅̅)=5000
P1(𝐷𝑃1
Ɵ1=w0+p1=55200
C(P1D)= ∞
D P2 P4 P6
P1 ∞ 100 0(100) 3800
P2 4400 ∞ 0(0) 0(600)
P4 0(4400) 0(0) ∞ 600
P6 12700 0(2400) 2400 ∞
R3=R4=0
Ɵ2=W0+r3+r4=50200
̅̅̅̅̅̅)=4400
P2(𝑃4𝐷
Ɵ3=Ɵ2+p2=54600
C(DP4)= ∞
C(P1P3)= ∞
P2 P4 P6
P1 100 ∞ 3800 -100
P2 ∞ 0 0
P6 12700 2400 ∞ -2400
R5=2500
R6=0
Ɵ4=Ɵ2+r5=52700
P2 P4 P6
P1 0(3700+10300) ∞ 3700
P2 ∞ 0(0) 0(3700)
P6 10300 0(10300) ∞
̅̅̅̅̅̅̅)14000
P3(𝑃1𝑃2
Ɵ5=Ɵ4+P3=66700
C(P2P1)= ∞
C(P2P4)= ∞
P4 P6
P2 ∞ 0
P6 0 ∞
Ɵ6(P2P6)=Ɵ7(P2P6)=Ɵ8(P6P4)=Ɵ9(P6P4)=Ɵ4=52700
R=D->P1->P2->P6->P4->D
D P6
P4
P1 P2
ω0
50200
(𝑃4, 𝐷) (P4,D)
θ3=54600 θ4=52700
nP2 = 19 europalete
nP3 = 11 europalete
nP4 = 11 europalete
nP6= 11 europalete
Vehiculul 1 D
35
30 D
25
Dinstanta parcursa [km]
20
P6
15
10
P2
5 P1
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 52.7 = 51.7 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (52.7 − 13.1) = 39.6𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
13.1
𝑃𝑔 = ∗ 100 = 24,5 %
52.7
Prestatia zilnica:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
450000
𝐺î𝑛𝑐 = ∗ 100 = 48.5 %
17600 ∗ 52.7
Sambata
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 3
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P2 P3 P7 R1=31600
D ∞ 15400 15100 18900 -15100
P2 15600 ∞ 7400 5300 -5300
P3 15100 7900 ∞ 6500 -6500
P7 19500 4700 7400 ∞ -4700
D P2 P3 P7 R2=8600
D ∞ 300 0 3800
P2 10300 ∞ 2100 0
P3 8600 1400 ∞ 0
P7 14800 0 2700 ∞
-8600
Wo=r1+r2=40100
D P2 P3 P7
D ∞ 300 0(300+2100) 3800
P2 1700 ∞ 2100 0(1700)
P3 0(1700) 1400 ∞ 0(0)
P7 6200 0(300+2700) 2700 ∞
̅̅̅̅̅̅̅)=3000
P1(𝑃7𝑃2
Ɵ1=w0+p1=43100
C(P2P7)
D P3 P7
D ∞ 0 3800
P2 1700 2100 ∞ -1700
P3 0 ∞ 0
R3=1700
R4=0
Ɵ2=w0+r3+r4=41800
D P3 P7
D ∞ 0(400+3800) 3800
P2 0(400) 400 ∞
P3 0(0) ∞ 0(3800)
P2(DP3)=4200
Ɵ3=Ɵ2+p2=46000
C(P3D)= ∞
D P7
P2 0 ∞
P3 ∞ 0
P2 P3
ω0
40100
(𝑃2, 𝐷) (P2,D)
θ5=41800 θ6 =41800
nP2 = 19 europalete
nP7 = 19 europalete
nP3 = 11 europalete
Vehiculul 1 D
45
D
40
35
Dinstanta parcursa [km]
30
25
20
15 P7
10 P3
5
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 41.8 = 41.8 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (41.8 − 15.6) = 26.2 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.6
𝑃𝑔 = ∗ 100 = 37.32 %
41.8
Prestatia zilnica:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
363540
𝐺î𝑛𝑐 = ∗ 100 = 63.4 %
13700 ∗ 41.8
Duminica
Pentru deservirea clientilor este necesar 1 singur vehicul. Astfel pentru servirea optima a celor 4
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P3 P4 P6 P7
D ∞ 15100 13100 26100 18900 -13100
P3 15100 ∞ 3300 12400 6500 -3300
P4 13100 3500 ∞ 13300 6900 -3500
P6 29600 15000 13700 ∞ 9100 -9100
P7 19500 7400 7100 8700 ∞ -7100
R1=36100
D P3 P4 P6 P7
D ∞ 2000 0 13000 58000
P3 11800 ∞ 0 9100 3200
P4 9600 0 ∞ 9800 2400
P6 20500 5900 4600 ∞ 0
P7 5300 300 0 1600 ∞
-5300 -1600
R2=6900
W0=r1+r2=43000
D P3 P4 P6 P7
D ∞ 2000 0(2000) 11400 58000
P3 6500 ∞ 0(3200) 7500 3200
P4 4300 0(2400+300) ∞ 8200 2400
P6 15200 5900 4600 ∞ 0(4600+2400)
P7 0(4300) 300 0(0) 0(7500) ∞
P1(P7P6)=7500
Ɵ1=wo+p1=50500
C(P6P7)
D P3 P4 P7 R3=4600
D ∞ 2000 0 5800
P3 6500 ∞ 0 3200
P4 4300 0 ∞ 2400
P7 15200 5900 4600 ∞ -4600
D P3 P4 P7 R4=6700
D ∞ 2000 0 5800
Ɵ2=wo+r3+r4=54300
P3 6500 ∞ 0 3200
P4 4300 0 ∞ 2400
P7 10600 1300 0 ∞
-4300 -2400
D P3 P4
P7 P6
ω0
43100
R1=36100
D P3 P4 P6 P7
D ∞ 2000 0 13000 5800
P3 11800 ∞ 0 9100 3200
P4 9600 0 ∞ 9800 2400
P6 20500 5900 4600 ∞ 0
P7 5300 300 0 ∞ ∞
-5300 -9100
R2=14400
W0=r1+r2=50500
D P3 P4 P6 P7
D ∞ 2000 0(2000) 3900 5800
P3 6500 ∞ 0(0) 0(700) 3200
P4 4300 0(700+300) ∞ 700 2400
P6 15200 5900 4600 ∞ 0(2400+4600)
P7 0(4300) 300 0(0) ∞ ∞
̅̅̅̅̅̅̅)=7000
P1(𝑃6𝑃7
Ɵ1=w0+p1=57500
D P3 P4 P6
D ∞ 2000 0(2000) 3900
P3 6500 ∞ 0(0) 0(700)
P4 4300 0(700+300 ∞ 700
P7 0(4300) 300 0(0) ∞
R3=0
R4=0
Ɵ2=w0+r3+r4=50500
̅̅̅̅̅̅)=4300
P2(𝑃7𝐷
Ɵ3=Ɵ2+p2=54800
C(DP6)= ∞
P3 P4 P6
D 2000 0(2000) ∞
P3 ∞ 0(0) 0(700)
P4 0(2000+700) ∞ 700
̅̅̅̅̅̅̅)=2700
P3(𝑃4𝑃3
Ɵ4= Ɵ2+p3=53200
C(P3P4)= ∞
P4 P6
D 0 ∞
P3 ∞ 0
(𝑃7, 𝐷) (P7,D)
θ3=54800 θ4=53200
nP7 = 19 europalete
nP3 = 11 europalete
nP4 = 11 europalete
nP6 = 11 europalete
70
D
60
50
Dinstanta parcursa [km]
40
P6
30
20 P3
10 P4
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14 14:43 15:11
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 53.2 = 53.2 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (53.2 − 19.5) = 33.7 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
Procentul parcursului gol:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
19.5
𝑃𝑔 = ∗ 100 = 36.65 %
53.2
Prestatia zilnica:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
585281
𝐺î𝑛𝑐 = ∗ 100 = 66.2 %
16600 ∗ 53.2
Parametrii obtinuti pentru scenariul cu desfasurare in 24 de ore
Media
Luni Marti Miercuri Joi Vineri Sambata Duminica
zilnica
Fluxul de 74.1 40.4 39.1 52.73 51.7 41.8 53.2 50.43
trafic
Fluxul de 43.5 25.1 19.9 39.6 39 26.2 33.7 36.01
transport
Procentul 41.6% 38.2% 49.1% 24.5% 24.5% 37.32% 36.65% 35.98%
parcursului
gol
Prestatia 156675 260020 169770 410400 450000 363540 585281 342240,85
zilnica
Gradul 49% 36.2% 24.6% 44.2% 48.5% 63.4% 66.2% 47.44%
mediu de
incarcare
Luni-Marti
Pentru deservirea clientilor sunt necesare 2 vehicuel. Astfel pentru servirea optima a celor 6
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
Vehicul 1(P1,P2,P3,P5)
D P1 P2 P3 P5
D ∞ 8700 15400 15100 20300 -8700
P1 13400 ∞ 6400 4000 9500 -4000
P2 15600 8400 ∞ 7400 4300 -4300
P3 15100 5300 7900 ∞ 7200 -5300
P5 19200 10500 2500 7700 ∞ -2500
R1=24800
D P1 P2 P3 P5
D ∞ 0 6700 6400 11600
P1 9400 ∞ 2400 0 5500
P2 11300 4100 ∞ 3100 0
P3 9800 0 2600 ∞ 1900
P5 16700 8000 0 2200 ∞
-9400
R2=9400
W0=r1+r2=34200
D P1 P2 P3 P5
D ∞ 0(6400) 6700 6400 11600
P1 0(400) ∞ 2400 0(2200) 5500
P2 1900 4100 ∞ 3100 0(1900+1900)
P3 400 0(400) 2600 ∞ 1900
P5 7300 8000 0(2200+2400) 2200 ∞
̅̅̅̅̅̅)=6400
P1(𝐷𝑃1
Ɵ1=w0+6400=40600
C(P1D)= ∞
D P2 P3 P5
P1 ∞ 2400 0 5500
P2 1900 ∞ 3100 0
P3 400 2600 ∞ 1900 -400
P5 7300 0 2200 ∞
R3=400
R4=0
Ɵ2=w0+r3+r4=34600
D P2 P3 P5
P1 ∞ 2400 0(2400+2200) 5500
P2 1900 ∞ 3100 0(1900+1500)
P3 0(1900+1500) 2200 ∞ 1500
P5 7300 0(2200+2400) 2200 ∞
̅̅̅̅̅̅̅)=4600
P2(𝑃1𝑃3
Ɵ3=Ɵ2+p2=39200
C(P3P1)= ∞
C(P3D)= ∞
D P2 P5
P2 1900 ∞ 0
P3 ∞ 2200 1500 -1500
P5 7300 0 ∞
R5=1500
R6=0
Ɵ4= Ɵ2+r5=36100
D P2 P5
P2 1900 ∞ 0
P3 ∞ 700 0
P5 7300 0 ∞
-1900
R7=0
R8=1900
Ɵ5= Ɵ4+1900=38000
D P2 P5
P2 0(5400) ∞ 0(0)
P3 ∞ 700 0(700)
P5 5400 0(700+5400) ∞
̅̅̅̅̅̅̅)=6100
P3(𝑃5𝑃2
Ɵ6= Ɵ5+ p3=44100
C(P2P5)= ∞
D P5
P2 0 ∞
P3 ∞ 0
P1 P2
ω0
34200
(𝑃2, 𝐷) (P2,D)
θ7 θ8
Vehicul 2( P4 P7)
D P4 P7
D ∞ 13100 18900 -13100
P4 13100 ∞ 5900 -5900
P7 19500 7100 ∞ -7100
R1=26100
D P4 P7
D ∞ 0 5800
P4 7200 ∞ 0
P7 12400 0 ∞
-7200
R2=7200
Wo=r1+r2=33300
D P4 P7
D ∞ 0(5800) 5800
P4 0(5200) ∞ 0(5800)
P7 5200 0(5200) ∞
̅̅̅̅̅̅)=5800
P1(𝐷𝑃4
Ɵ1=w0+p1=39100
C(P4D)= ∞
D P7
P4 ∞ 0
P7 5200 ∞
-5200
R3=0
R4=5200
Ɵ2=w0+r3+r4=38500
D P7
P4 ∞ 0
P7 0 ∞
R=D->P4->P7->D
D P4
P7
ω0
33300
(𝑃7, 𝐷) (P7,D)
θ5 θ6
Calculul parametrilor pentru ziua de luni-marti:
nP3 = 11 europalete
nP1 = 19 europalete
nP7 = 19 europalete
nP5 = 11 europalete
nP2 = 19europalete
nP4 = 11 europalete
Ttotal circuit 1 = 60*2+8.7/0,25+11*2+7.2/0,25+11*2+2.5/0,25+19*2+15.6/0.25 =338
minute=5,63 ore
Vehiculul 1 D
40
D
35
30
Dinstanta parcursa [km]
25
P5
20
15 P3
10
P1
5
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14
Timp [h]
45
40 D
35
Dinstanta parcursa [km]
30
25 P7
20
P4
15
10
5
D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 38 + 1 ∗ 38,5 = 76.5 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (38 − 15.6) + 1 ∗ (38,5 − 19.5) = 41.4 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
Procentul parcursului gol:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.6
𝑃𝑔 𝑣𝑒ℎ 1 = ∗ 100 = 41.05 %
38
19.5
𝑃𝑔 𝑣𝑒ℎ 2 = ∗ 100 = 50.64 %
38,5
𝑃𝑔 𝑚𝑒𝑑 = 45.84 %
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 1 = 22500 ∗ 8.7 + 4900 ∗ 7.2 = 231030 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 2 = 12700 ∗ 13.1 + 3900 ∗ 5.9 = 189380 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑚𝑒𝑑 = 210205 𝑘𝑔 ∗
𝑧𝑖
Gradul mediu de încărcare al vehiculului:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
231030 189380
𝐺î𝑛𝑐 = ( + ) ∗ 100 = 61 %
17600 ∗ 38 17600 ∗ 38,5
Miercuri-Joi
Pentru deservirea clientilor sunt necesare 2 vehicule. Astfel pentru servirea optima a celor 6
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
D P1 P2 P3
D ∞ 8700 15400 15100 -8700
P1 13400 ∞ 6400 4000 -4000
P2 15600 8400 ∞ 7400 -7400
P3 15100 5300 7900 ∞ -5300
R1=25400
D P1 P2 P3
D ∞ 0 6700 6400
P1 9400 ∞ 2400 0
P2 8200 1000 ∞ 0
P3 9800 0 2600 ∞
-8200 -2400
R2=10600
W0=r1+r2=36000
D P1 P2 P3
D ∞ 0(4300) 4300 6400
P1 1200 ∞ 0(200) 0(1200)
P2 0(1200) 1000 ∞ 0(0)
P3 1600 0(200) 200 ∞
̅̅̅̅̅̅)=4300
P1(𝐷𝑃1
Ɵ1=w0+p1=40300
C(P1D)= ∞
D P2 P3
P1 ∞ 0 0
P2 0 ∞ 0
P3 1600 200 ∞ -200
R3=200
R4=0
Ɵ2=w0+r4=36200
D P2 P3
P1 ∞ 0(0) 0(0)
P2 0(1400) ∞ 0(0)
P3 1400 0(1400) ∞
̅̅̅̅̅̅̅)=1400
P2(𝑃3𝑃2
Ɵ3=Ɵ2+p2=37600
C(P2P3)
D P3
P1 ∞ 0
P2 0 ∞
D P3
P1 P2
ω0
36000
(𝑃2, 𝐷) (P2,D)
θ5 θ6
Vehicul 2( P4,P5,P6 )
D P4 P5 P6
D ∞ 13100 20300 26100 -13100
P4 13100 ∞ 7600 13300 -7600
P5 19200 8300 ∞ 7700 -7700
P6 29600 13700 7300 ∞ -7300
R1=35700
D P4 P5 P6
D ∞ 0 7200 13000
P4 5500 ∞ 0 5700
P5 11500 600 ∞ 0
P6 22300 6400 0 ∞
-5500
R2=5500
W0=r1+r2=41200
D P4 P5 P6
D ∞ 0(600+7200) 7200 13000
P4 0(6000) ∞ 0(0) 5700
P5 6000 600 ∞ 0(600+5700)
P6 16800 6400 0(6400) ∞
P1(DP1)=7800
Ɵ1=w0+p1=49000
C(P4D)= ∞
D P5 P6
P4 ∞ 0 5700
P5 6000 ∞ 0
P6 16800 0 ∞
-16800
R3=0
R4=6000
Ɵ2=w0+r4=47200
D P5 P6
P4 ∞ 0(5700) 5700
P5 0(10800) ∞ 0(5700)
P6 10800 0(10800) ∞
̅̅̅̅̅̅̅)=10800
P2(𝑃6𝑃5
Ɵ3= Ɵ2+p2=58000
C(P5P6)= ∞
D P6
P4 ∞ 0
P5 0 ∞
P6 P5
ω0
41200
nP3 = 11 europalete
nP1 = 19 europalete
nP6 = 11 europalete
nP5 = 11 europalete
nP2 = 19europalete
nP4 = 11 europalete
Vehiculul 1 D
40
D
35
30
Dinstanta parcursa [km]
25
20
P3
15
10
P1
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45
Timp [h]
Fig11.Ciclograma circulatiei vehiculului 1
Vehiculul 2 D
60
D
50
Dinstanta parcursa [km]
40
30
20 P6
P4
10
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 36.2 + 1 ∗ 47.2 = 83.4 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (36.2 − 15.6) + 1 ∗ (47.2 − 19.2) = 48.6 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
Procentul parcursului gol:
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.6
𝑃𝑔 𝑣𝑒ℎ 1 = ∗ 100 = 43.09 %
36.2
19.2
𝑃𝑔 𝑣𝑒ℎ 2 = ∗ 100 = 40.67 %
47.2
𝑃𝑔 𝑚𝑒𝑑 = 41.88 %
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 1 = 12700 ∗ 8.7 + 4900 ∗ 4 = 130090 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 2 = 12700 ∗ 13.1 + 3900 ∗ 19.2 = 241250 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑚𝑒𝑑 = 185670 𝑘𝑔 ∗
𝑧𝑖
Gradul mediu de încărcare al vehiculului:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
130900 241250
𝐺î𝑛𝑐 = ( + ) ∗ 100 = 49.45 %
17600 ∗ 36.2 17600 ∗ 47.2
Vineri-Sambata
Pentru deservirea clientilor sunt necesare 2 vehicule. Astfel pentru servirea optima a celor 6
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
Vehicul 1( P1,P2,P3 )
D P1 P2 P3
D ∞ 8700 15400 15100 -8700
P1 13400 ∞ 6400 4000 -4000
P2 15600 8400 ∞∞ 7400 -7400
P3 15100 5300 7900 ∞ -5300
R1=25400
D P1 P2 P3
D ∞ 0 6700 6400
P1 9400 ∞ 2400 0
P2 8200 1000 ∞∞ 0
P3 9800 0 2600 ∞
-8200 -2400
R2=10600
W0=r1+r2=36000
D P1 P2 P3
D ∞ 0(4300) 4300 6400
P1 1200 ∞ 0(200) 0(0)
P2 0(1200) 1000 ∞∞ 0(0)
P3 1600 0(200) 200 ∞
P1(DP1)=4300
Ɵ1=w0+p1=40300
C(P1D)= ∞
D P2 P3
P1 ∞ 0 0
P2 0 ∞ 0
P3 1600 200 ∞ -200
R3=200
R4=0
Ɵ2=w0+r3=36200
D P2 P3
P1 ∞ 0(0) 0(0)
P2 0(1400) ∞ 0(0)
P3 1400 0(1400) ∞
̅̅̅̅̅̅̅)=1400
P2(𝑃3𝑃2
Ɵ3=Ɵ2+p2=37600
C(P2P3)= ∞
D P3
P1 ∞ 0
P2 0 ∞
D P3
P1 P2
ω0
36000
R1=35200
D P4 P6 P7
D ∞ 0 13000 5800
P4 7200 ∞ 7400 0
P6 20500 4600 ∞ 0
P7 12400 0 1600 ∞
-7200 -1600
R2=8800
W0=r1+r2=44000
D P4 P6 P7
D ∞ 0(5800) 11400 5800
P4 0(5200) ∞ 5800 0(0)
P5 13300 4600 ∞ 0(4600)
P7 5200 0(0) 0(5800) ∞
̅̅̅̅̅̅)=5800
P1(𝐷𝑃4
Ɵ1=w0+p1=49800
C(P4D)= ∞
D P6 P7
P4 ∞ 5800 0
P6 13300 ∞ 0
P7 5200 0 ∞
-5200
R3=0
R4=5200
Ɵ2=w0+r4=49200
D P6 P7
P4 ∞ 5800 0(5800)
P6 8100 ∞ 0(8100)
P7 0(8100) 0(5800) ∞
P2(P6P7)=8100
Ɵ3=Ɵ2+p2=57300
C(P7P6)= ∞
D P6
P4 ∞ 5800 -5800
P7 0 ∞
R5=5800
R6=0
Ɵ4= Ɵ2+r5=55000
D P6
P4 ∞ 0
P7 0 ∞
D P4
P7 P6
ω0
44000
nP3 = 11 europalete
nP1 = 19 europalete
nP6 = 11 europalete
nP7 = 19 europalete
nP2 = 19europalete
nP4 = 11 europalete
40
D
Dinstanta parcursa [km] 35
30
25
20
P3
15
10 P1
5
0 D D
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45
Timp [h]
Vehiculul 2 D
60
D
50
Dinstanta parcursa [km]
40
30 P6
20
P4
10
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14
Timp [h]
Fig14.Ciclograma circulatiei vehiculului 2
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 36.2 + 1 ∗ 55 = 91.2 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (36.2 − 15.6) + 1 ∗ (47.2 − 19.5) = 48.3 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
∑ 𝑑𝑖∗
𝑃𝑔 = ∗ 100
∑ 𝑑𝑖
15.6
𝑃𝑔 𝑣𝑒ℎ 1 = ∗ 100 = 43.09 %
36.2
19.5
𝑃𝑔 𝑣𝑒ℎ 2 = ∗ 100 = 35.45 %
55
𝑃𝑔 𝑚𝑒𝑑 = 39.27 %
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 1 = 17600 ∗ 8.7 + 4900 ∗ 4 = 172720 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 2 = 13700 ∗ 13.1 + 3900 ∗ 19.5 = 255520 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑚𝑒𝑑 = 214120 𝑘𝑔 ∗
𝑧𝑖
Gradul mediu de încărcare al vehiculului:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
172720 255520
𝐺î𝑛𝑐 = ( + ) ∗ 100 = 53.49 %
17600 ∗ 36.2 17600 ∗ 55
Duminica-Luni
Pentru deservirea clientilor sunt necesare 2 vehicule. Astfel pentru servirea optima a celor 7
puncte de destinatie folosim Algoritmul Comis Voiajorului dupa cum urmeaza:
Vehicul 1( P1,P2,P3,P4 )
D P1 P2 P3 P4
D ∞ 8700 15400 15100 13100 -8700
P1 13400 ∞∞ 6400 4000 6300 -4000
P2 15600 8400 ∞∞ 7400 5600 -5600
P3 15100 5300 7900 ∞ 3300 -3300
P4 13100 8100 7500 3500 ∞ -3500
R1=25100
D P1 P2 P3 P4
D ∞ 0 6700 6400 4400
P1 9400 ∞∞ 2400 0 2300
P2 10000 2800 ∞∞ 1800 0
P3 11800 2000 4600 ∞ 0
P4 9600 4600 4000 0 ∞
-9400 -2400
R2=11800
W0=r1+r2=36900
D P1 P2 P3 P4
D ∞ 0(2000+4300) 4300 6400 4400
P1 0(600) ∞∞ 0(1600) 0(0) 2300
P2 600 2800 ∞∞ 1800 0(600)
P3 2400 2000 2200 ∞ 0(2000)
P4 200 4600 1600 0(200) ∞
P1(DP1)=6300
Ɵ1=w0+p1=43200
C(P1D)= ∞
D P2 P3 P4
D ∞ 0 0 2300
P2 600 ∞ 1800 0
P3 2400 2200 ∞ 0
P4 200 1600 0 ∞
-200
R3=200
R4=0
Ɵ2=w0+r3=37100
D P2 P3 P4
D ∞ 0(1600) 0(0) 2300
P2 400 ∞ 1800 0(400)
P3 2200 2200 ∞ 0(2000)
P4 0(400) 1600 0(0) ∞
P2(P3P4)=2000
Ɵ3= Ɵ2+p2=39100
C(P4P3)= ∞
D P2 P3
P1 ∞ 0 0
P2 400 ∞∞ 1800 -400
P4 0 1600 ∞
R5=400
R6=0
Ɵ4= Ɵ2+r5=37500
D P2 P3
P1 ∞ 0(1600) 0(1400)
P2 0(400) ∞ 1400
P4 0(1600) 1600 ∞
P3(P1P2)=1600
Ɵ5= Ɵ4+p3=39100
C(P2P1)= ∞
C(P2D)= ∞
D P3
P2 ∞ 1400 -1400
P4 0 ∞
R7=1400
R8=0
Ɵ6= Ɵ4+r7=38900
D P3
P2 ∞ 0
P4 0 ∞
D P4 P3
P1 P2
ω0
36900
D P5 P6 P7
D ∞ 20300 26100 18900 -18900
P5 19200 ∞ 7700 4200 -4200
P6 29600 7300 ∞ 9100 -7300
P7 19500 5200 8700 ∞ -5200
R1=35600
D P5 P6 P7
D ∞ 1400 7200 0
P5 15000 ∞ 3500 0
P6 22300 0 ∞ 1800
P7 14300 0 3500 ∞
-14300 -3500
R2=17800
W0=r1+r2=53400
D P5 P6 P7
D ∞ 1400 3700 0(1400)
P5 700 ∞ 0(0) 0(0)
P6 8000 0(1800) ∞ 1800
P7 0(700) 0(0) 0(0) ∞
̅̅̅̅̅̅̅)=1800
P1(𝑃6𝑃5
Ɵ1=w0+p1=55200
C(P5P6)= ∞
Ɵ2=53400
D P6 P7
D ∞ 3700 0(3700)
P5 700 ∞ 0(700)
P7 0(700) 0(3700) ∞
̅̅̅̅̅̅)=3700
P2(𝐷𝑃7
Ɵ3=w0+p3=57100
C(P7D)= ∞
D P6
P5 700 ∞ -700
P7 ∞ 0
R3=700
R4=0
Ɵ4= Ɵ2+r3=54100
D P6
P5 0 ∞
P7 ∞ 0
P7 P6
ω0
53400
(𝑃5, 𝐷) (P5,D)
θ5 θ6
(P7,P6) (P7,P6)
θ7 θ8
nP3 = 11 europalete
nP1 = 19 europalete
nP6 = 11 europalete
nP7 = 19 europalete
nP2 = 19europalete
nP4 = 11 europalete
nP4 = 11 europalete
45
D
40
35
Dinstanta parcursa [km]
30
25 P4
20
15
P2
10
P1
5
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16 13:45 14:14 14:43
Timp [h]
60
D
50
Dinstanta parcursa [km]
40
P7
30
P5
20
10
D D
0
7:59 8:28 8:57 9:26 9:55 10:23 10:52 11:21 11:50 12:19 12:47 13:16
Timp [h]
ф𝑡𝑟𝑎𝑓𝑖𝑐 = ∑ 𝑛𝑖 ∗ 𝑑𝑖
𝑘𝑚
ф𝑡𝑟𝑎𝑓𝑖𝑐 = 1 ∗ 38.9 + 1 ∗ 54.1 = 93 𝑣𝑒ℎ ∗
𝑧𝑖
Fluxul de transport:
𝑘𝑚
ф𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡 = 1 ∗ (38.9 − 13.1) + 1 ∗ (54.1 − 19.2) = 60.7 𝑣𝑒ℎ 𝑖𝑛𝑐ă𝑟𝑐𝑎𝑡𝑒 ∗
𝑧𝑖
13.1
𝑃𝑔 𝑣𝑒ℎ 1 = ∗ 100 = 33.67 %
38.9
19.2
𝑃𝑔 𝑣𝑒ℎ 2 = ∗ 100 = 35.48 %
54.1
𝑃𝑔 𝑚𝑒𝑑 = 34.57 %
Prestatia zilnica:
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 1 = 22500 ∗ 8.7 + 4900 ∗ 6.4 = 227110 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑣𝑒ℎ 2 = 16600 ∗ 18.9 + 3900 ∗ 8.7 = 347670 𝑘𝑔 ∗
𝑧𝑖
𝑘𝑚
𝑃𝑧 𝑚𝑒𝑑 = 287390 𝑘𝑔 ∗
𝑧𝑖
Gradul mediu de încărcare al vehiculului:
𝑃𝑧
𝐺î𝑛𝑐 = ( ) ∗ 100
𝑄𝑣𝑒ℎ ∗ 𝑑𝑐𝑖𝑟𝑐𝑢𝑖𝑡
227110 347670
𝐺î𝑛𝑐 = ( + ) ∗ 100 = 69.68 %
17600 ∗ 38.9 17600 ∗ 54.1
Parametrii obtinuti pentru scenariul cu desfasurare in 48 de ore
Parametrii
Se consideră varianta decizională caracterizată prin 2 variante de decizie ( livrări la 24 ore sau 48
ore) cinci criterii de decizie cantitative și un criteriu calitativ. Se admite că matricea rezultatelor este
cea reprezentată în tabelul de mai jos.
Parametrii
Variante Gradul
Fluxul de Fluxul de Procentului Prestatia
mediu de Penalizare
trafic transport parcursului gol zilnica
încărcare
livrări
Se estimează utilitățile pe o scară 0-1 pentru fiecare criteriu (parametru) în parte. Astfel se
obține următoarea matrice a utilităților:
Parametrii
Variante Gradul
Fluxul de Fluxul de Procentului Prestatia
mediu de Penalizare
trafic transport parcursului gol zilnica
încărcare
livrări
24h 0 1 1 0 0 0
48h 1 0 0 1 0 0
Varianta optimă este cea cu livrări la 48h deoarece acesteia îi corespunde o utilitate maximă.
Dimensionarea depozitului
unde:
n – numărul de ordine;18
54000
𝐶𝑁𝐷 = ∗ 2 ∗ 1.15 ∗ 1 = 872 𝑐𝑒𝑙𝑢𝑙𝑒
0.57 ∗ 250
unde:
𝐿 𝐻 100 3 𝑐𝑒𝑙𝑢𝑙𝑒
𝑁𝐶𝑆 = [ ]∗[ ]=[ ] ∗ [ ] = 67 ∗ 2 = 134
∆x ∆x 1.5 1.3 𝑠𝑡𝑒𝑙𝑎𝑗
𝐶𝑁𝐷 872
𝑁𝐵𝑆 = = = 7
𝑁𝐶𝑆 134
𝐻 3
𝑁𝑉 = [ ] + 1 = [ ] + 1 = 4 𝑛𝑖𝑣𝑒𝑙𝑒
𝑧 1.2
134
𝑁𝐶𝑉 = = 34 𝑐𝑒𝑙𝑢𝑙𝑒 𝑝𝑒 𝑛𝑖𝑣𝑒𝑙
4
4150mm
Intrare Depozit 3
4150mm 0
Spatiu de manevrea pentru utilajele de manipulare a marfurilor 5
5
0
m
m
4150mm
Spatiu de manevrea pentru utilajele de manipulare a marfurilor
4150mm
24150 mm