-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUntitled2.m
More file actions
264 lines (240 loc) · 5.17 KB
/
Copy pathUntitled2.m
File metadata and controls
264 lines (240 loc) · 5.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
clc;
load mymap.mat;
w=xlsread('map.xlsx');
%w为有径矩阵
w(isnan(w))=0;
Temp=[D;Z;F;J];
% figure(1);
% plot(D(:,1),D(:,2),'+');
% hold on;
% plot(F(:,1),F(:,2),'s');
% hold on
% plot(Z(:,1),Z(:,2),'d');
% hold on
% plot(J(:,1),J(:,2),'o');
% hold on;
% u=triu(w);
% d=tril(w);
dist=inf(130);
for i=1:1:130
for j=1:1:130
if w(i,j)>0;
x=[Temp(i,1),Temp(j,1)];
y=[Temp(i,2),Temp(j,2)];
%点到点距离矩阵dist
dist(i,j)=sqrt((Temp(i,1)-Temp(j,1))^2+(Temp(i,2)-Temp(j,2))^2);%所有连线点的距离
% plot(x,y,'k');
end
if i==j
dist(i,j)=0;
end
clear x y;
end
end
clear i j;
%%%%%%%%%即所有F发射到J25、J34、J36、J42、J49的最短路径下的时间判断
%J25->93到发射台i
for i=9:1:68
if i==9
[distance1,path1] = mydijkstra(dist,93,i);%使用dijkstra
path1=[path1,zeros(1,130-length(path1))];
else
[d,p]=mydijkstra(dist,93,i);
p=[p,zeros(1,130-length(p))];
path1=[path1;p];
end
end
clear p d;
% [distance path] = mydijkstra(dist,1,42);
%出发地为J34->102到发射台i
for i=9:1:68
if i==9
[distance2,path2] = mydijkstra(dist,102,i);%使用dijkstra
path2=[path2,zeros(1,130-length(path2))];
else
[d,p]=mydijkstra(dist,102,i);
p=[p,zeros(1,130-length(p))];
path2=[path2;p];
end
end
clear p d;
%出发地为J36->104到发射台i
for i=9:1:68
if i==9
[distance3,path3] = mydijkstra(dist,104,i);%使用dijkstra
path3=[path3,zeros(1,130-length(path3))];
else
[d,p]=mydijkstra(dist,104,i);
p=[p,zeros(1,130-length(p))];
path3=[path3;p];
end
end
clear p d;
%出发地为J42->110到发射台i
for i=9:1:68
if i==9
[distance4,path4] = mydijkstra(dist,110,i);%使用dijkstra
path4=[path4,zeros(1,130-length(path4))];
else
[d,p]=mydijkstra(dist,117,i);
p=[p,zeros(1,130-length(p))];
path4=[path4;p];
end
end
clear p d i;
%出发地为J49->117到发射台i
for i=9:1:68
if i==9
[distance5,path5] = mydijkstra(dist,117,i);%使用dijkstra
path5=[path5,zeros(1,130-length(path5))];
else
[d,p]=mydijkstra(dist,117,i);
p=[p,zeros(1,130-length(p))];
path5=[path5;p];
end
end
clear p d i;
% ss(1)=sum(distance1)
% ss(2)=sum(distance2)
% ss(3)=sum(distance3)
% ss(4)=sum(distance4)
% [u v]=sort(ss);
path1=path1(:,any(path1));%删除全为0列
path2=path2(:,any(path2));%删除全为0列
path3=path3(:,any(path3));%删除全为0列
path4=path4(:,any(path4));%删除全为0列
path5=path5(:,any(path5));%删除全为0列
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%J25
[m,n]=size(path1);
wp1=zeros(130,130,m);
for i=1:1:m
for j=1:1:n-1
if path1(i,j+1)~=0
wp1(path1(i,j),path1(i,j+1),i)=1; %有向路径
end
end
end
clear i j m n;
%%%%%J34
[m,n]=size(path2);
wp2=zeros(130,130,m);
for i=1:1:m
for j=1:1:n-1
if path2(i,j+1)~=0
wp2(path2(i,j),path2(i,j+1),i)=1; %有向路径
end
end
end
clear i j m n;
%%%%%J36
[m,n]=size(path3);
wp3=zeros(130,130,m);
for i=1:1:m
for j=1:1:n-1
if path3(i,j+1)~=0
wp3(path3(i,j),path3(i,j+1),i)=1; %有向路径
end
end
end
clear i j m n;
%%%%%J42
[m,n]=size(path4);
wp4=zeros(130,130,m);
for i=1:1:m
for j=1:1:n-1
if path4(i,j+1)~=0
wp4(path4(i,j),path4(i,j+1),i)=1; %有向路径
end
end
end
clear i j m n;
%%%%%J49
[m,n]=size(path5);
wp5=zeros(130,130,m);
for i=1:1:m
for j=1:1:n-1
if path5(i,j+1)~=0
wp5(path5(i,j),path5(i,j+1),i)=1; %有向路径
end
end
end
clear i j m n;
%%%%%%%%%%%%%%%%%%
Va=45.*ones(130);
Vb=35.*ones(130);
Vc=30.*ones(130);
%Va,b,c重新赋主干道
for i=69:1:78
Va(i,i+1)=70;
Vb(i,i+1)=60;
Vc(i,i+1)=50;
end
clear i;
for i=80:1:87
Va(i,i+1)=70;
Vb(i,i+1)=60;
Vc(i,i+1)=50;
end
clear i;
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
disto=dist;
disto(isinf(disto))=0;
ta=disto./Va;tb=disto./Vb;tc=disto./Vc;
tq=sum(sum(ta+tb+tc));
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%5
for k=1:1:60
a=tq.*wp1(:,:,k);
a(isnan(a))=0;
tj(:,:,k)=a;
Tj25(1,k)=sum(sum(tj(:,:,k)));
clear a;
end
clear tj;
for k=1:1:60
a=tq.*wp2(:,:,k);
a(isnan(a))=0;
tj(:,:,k)=a;
Tj34(1,k)=sum(sum(tj(:,:,k)));
clear a;
end
clear tj;
for k=1:1:60
a=tq.*wp3(:,:,k);
a(isnan(a))=0;
tj(:,:,k)=a;
Tj36(1,k)=sum(sum(tj(:,:,k)));
clear a;
end
clear tj;
for k=1:1:60
a=tq.*wp4(:,:,k);
a(isnan(a))=0;
tj(:,:,k)=a;
Tj42(1,k)=sum(sum(tj(:,:,k)));
clear a;
end
clear tj;
for k=1:1:60
a=tq.*wp5(:,:,k);
a(isnan(a))=0;
tj(:,:,k)=a;
Tj49(1,k)=sum(sum(tj(:,:,k)));
clear a;
end
clear tj;
qTj25=Tj25./tq;
qTj34=Tj34./tq;
qTj36=Tj36./tq;
qTj42=Tj42./tq;
qTj49=Tj49./tq;
su(1,1)=sum(qTj25);
su(1,2)=sum(qTj34);
su(1,3)=sum(qTj36);
su(1,4)=sum(qTj42);
su(1,5)=sum(qTj49);
[B,I]=sort(su);
e={'J25' 'J34' 'J36' 'J42' 'J49'};
disp('临时装载区节点是:')
e(I(1)),e(I(2))
% disp('应选'+e(I(1))+'和'+e(I(2))+'%作为临时装载区');