-
Notifications
You must be signed in to change notification settings - Fork 2
/
optimizeroute_multidto.m
170 lines (164 loc) · 9.46 KB
/
optimizeroute_multidto.m
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
%%%%%%% Top-down supply chain optimization %%%%%%%%
% function newroutepref=optimizeroute(nnodes,subflow,supplyfit,activenodes,...
% subroutepref,EdgeTable,SLRISK,ADDVAL,CTRANS,losstolval)
function newroutepref=optimizeroute_multidto(dtorefvec,subflow,supplyfit,expmax,...
subroutepref,dtoEdgeTable,dtoSLRISK,dtoADDVAL,dtoCTRANS,losstolval,dtoslsuc)
% allnodes=2:subnnodes;
iactiveedges=find(subflow > 0 | dtoslsuc > 0);
[actrow,actcol]=ind2sub(size(subflow),iactiveedges);
edgeparms=[subflow(iactiveedges) dtoSLRISK(iactiveedges) iactiveedges actrow actcol];
% if supplyfit <= losstolval %need to consolidate supply chain (not
% capacity constaint)
if supplyfit < losstolval %need to consolidate supply chain
edgesort=sortrows(edgeparms,-2); %refernce this array when removing edges
iprimary=find(edgesort(:,4) == 1 & edgesort(:,5) ~= length(dtorefvec)); %primary movement
% edgecut=1:min(round(length(iactiveedges)*(1-(supplyfit/...
% (supplyfit+losstolval)))),length(iactiveedges)-1); %calc how many edges need to be removed
edgecut=1:min(round(length(iactiveedges)*(supplyfit/...
(supplyfit+losstolval))),length(iactiveedges)-1);
% iedgecut=edgecut(edgesort(edgecut,2)> min(edgeparms(:,2)));
% if length(iedgecut) < length(edgecut) % are there less high risk edges than need to be removed?
% %remove as many high risk edges that are greater than minimum risk
% %edges, and then remove lowest volume edges
% if isempty(find(iedgecut,1)) == 1
% secondsort=sortrows(edgeparms,1);
% else
% secondsort=sortrows(edgeparms(~ismember(edgeparms(:,3),...
% edgesort(edgecut(iedgecut),3)),:),1); %sort based on volume (low to high)
% end
% inewcuts=find(ismember(edgesort(:,3),secondsort(1:length(edgecut)-...
% length(iedgecut),3)) == 1); %match based on unique iactiveedges
% edgecut=[edgecut(iedgecut)'; inewcuts];
% end
%%% Preserve at least one primary movement
minrisk_primary=min(edgesort(iprimary,2));
ikeep_primary=find(edgesort(iprimary,2) == minrisk_primary);
if length(ikeep_primary) == 1
edgecut=edgecut(~ismember(edgecut,[iprimary(ikeep_primary); ...
find(edgesort(edgecut,4)==edgesort(iprimary(ikeep_primary),5))]));
else
maxprofit_primary=max(edgesort(iprimary(ikeep_primary),1));
ikeep_primary=ikeep_primary(edgesort(iprimary(ikeep_primary),1) == ...
maxprofit_primary);
if length(ikeep_primary) == 1
edgecut=edgecut(~ismember(edgecut,[iprimary(ikeep_primary); ...
find(edgesort(edgecut,4)==edgesort(iprimary(ikeep_primary),5))]));
else
% ikeep_primary=ikeep_primary(ceil(length(ikeep_primary)*rand(1)));
ikeep_primary=ikeep_primary(1);
edgecut=edgecut(~ismember(edgecut,[iprimary(ikeep_primary); ...
find(edgesort(edgecut,4)==edgesort(iprimary(ikeep_primary),5))]));
end
end
% edgecut=find(dtoADDVAL(edgesort(edgecut,3))-dtoCTRANS(edgesort(edgecut,3)) <= 0); %only discard nodes losing money
% remove highest risk edges
for j=1:length(edgecut)
icheckroute=find(subflow(edgesort(edgecut(j),4),...
ismember(dtorefvec,dtoEdgeTable.EndNodes(dtoEdgeTable.EndNodes(:,1)==...
dtorefvec(edgesort(edgecut(j),4)),2))) > 0);
% icheckroute=find(subflow(edgesort(edgecut(j),4),ismember(dtorefvec,...
% dtoEdgeTable.EndNodes(ismember(dtoEdgeTable.EndNodes(:,1),...
% cuttable(:,1)),2))) > 0); % check if affected node has more than one active recipient
actroutes=dtoEdgeTable.EndNodes(dtoEdgeTable.EndNodes(:,1)==...
dtorefvec(edgesort(edgecut(j),4)),1);
% icheckroute=find(subflow(edgesort(edgecut(j),4),...
% dtoEdgeTable.EndNodes(dtoEdgeTable.EndNodes(:,1)==...
% edgesort(edgecut(j),4),2)) > 0);
% actroutes=dtoEdgeTable.EndNodes(dtoEdgeTable.EndNodes(:,1)==edgesort(edgecut(j),4),1);
checknoderoutes=(length(actroutes(icheckroute)) == length(find(edgesort(edgecut,4) == ...
edgesort(edgecut(j),4)))); % check if all acctive edges will be removed
if checknoderoutes == 1
cutsenders=find(ismember(dtorefvec,dtoEdgeTable.EndNodes(...
dtoEdgeTable.EndNodes(:,2)==dtorefvec(edgesort(edgecut(j),4)),1)) == 1);
% cutsenders=find(ismember(dtorefvec,dtoEdgeTable.EndNodes(...
% ismember(dtoEdgeTable.EndNodes(:,2),cuttable(:,2)),1)) == 1);
% cutsenders=dtoEdgeTable.EndNodes(dtoEdgeTable.EndNodes(:,2)==...
% edgesort(edgecut(j),4),1);
cutind=sub2ind(size(dtoSLRISK),cutsenders,edgesort(edgecut(j),4)*...
ones(length(cutsenders),1));
subroutepref(cutind)=0;
end
if length(icheckroute) == 1
subroutepref(edgesort(edgecut(j),3))=0; %remove high risk edge (only edge) from node
irmvsender=(edgesort(:,5) == edgesort(edgecut(j),4)); %find nodes sending to affected node
subroutepref(edgesort(irmvsender,3))=0; %remove sending edges
else
subroutepref(edgesort(edgecut(j),3))=0;
end
end
elseif supplyfit >= losstolval %need to expand supply chain
% potnodes=allnodes(~ismember(allnodes,subactivenodes));
potnodes=dtorefvec(~ismember(dtorefvec,[1; dtorefvec(unique(edgeparms(:,4:5)))]));
% edgeadd=1:min(max(ceil((supplyfit-losstolval)/supplyfit),1),length(potnodes));
% edgeadd=1:min(max(ceil(supplyfit/...
% (sum(dtoADDVAL(iactiveedges)- dtoCTRANS(iactiveedges))*...
% sum(sum(subflow)))),1),10);
edgeadd=1:min(max(ceil(supplyfit/losstolval),1),min(expmax,length(potnodes)));
if isempty(find(potnodes,1)) == 1
% display('No more nodes to expand')
% subroutepref(iactiveedges)=1-SLRISK(iactiveedges);
% could introduce new edges by modifying ADJ?
else
newedgeparms=[];
potsenders=unique(edgeparms(:,4:5)); %dto node index
potsenders=potsenders(potsenders~=length(dtorefvec));
for k=1:length(potsenders)
ipotreceive=find(ismember(potnodes,dtoEdgeTable.EndNodes(...
dtoEdgeTable.EndNodes(:,1)==dtorefvec(potsenders(k)),2)) == 1);
if isempty(find(ipotreceive,1)) == 1
continue
end
% ipotedge=sub2ind(size(dtoSLRISK),potsenders(k)*ones(length(ipotreceive),1),ipotreceive);
ipotedge=sub2ind(size(dtoSLRISK),potsenders(k)*ones(length(ipotreceive),1),find(ismember(dtorefvec,potnodes(ipotreceive))==1));
newedgeparms=[newedgeparms; (dtoADDVAL(ipotedge)-...
dtoCTRANS(ipotedge)) dtoSLRISK(ipotedge) ...
ipotedge ipotreceive];
end
% for k=1:length(potnodes)
% potsenders=unique(dtoEdgeTable.EndNodes(ismember(dtoEdgeTable.EndNodes(:,2),...
% potnodes(k)),1));
% % potsenders=potsenders(ismember(potsenders,[1; subactivenodes]));
% potsenders=potsenders(ismember(potsenders,[1; dtorefvec(unique(edgeparms(:,4:5)))]));
% ipotsenders=find(ismember(potsenders,dtorefvec(1:length(dtorefvec)-1)) == 1);
% % ipotedge=sub2ind(size(dtoSLRISK),potsenders,...
% % potnodes(k)*ones(length(potsenders),1));
% % newedgeparms=[newedgeparms; (dtoADDVAL(potsenders,potnodes(k))-...
% % dtoCTRANS(potsenders,potnodes(k))).*(1-dtoSLRISK(potsenders,potnodes(k))) ...
% % dtoSLRISK(potsenders,potnodes(k)) ipotedge k*ones(length(potsenders),1)];
% ipotedge=sub2ind(size(dtoSLRISK),find(ismember(dtorefvec,...
% potsenders(ipotsenders)) == 1),...
% find(dtorefvec == potnodes(k))*ones(length(potsenders),1));
% % newedgeparms=[newedgeparms; (dtoADDVAL(ipotsenders,k)-...
% % dtoCTRANS(ipotsenders,k)).*(1-dtoSLRISK(ipotsenders,k)) ...
% % dtoSLRISK(ipotsenders,k) ipotedge k*ones(length(ipotsenders),1)];
% newedgeparms=[newedgeparms; (dtoADDVAL(ipotsenders,k)-...
% dtoCTRANS(ipotsenders,k)) dtoSLRISK(ipotsenders,k) ...
% ipotedge k*ones(length(ipotsenders),1)];
% end
% edgesort=sortrows(newedgeparms,2); %refernce this array when removing edges
edgesort=sortrows(newedgeparms,-1);
subroutepref(edgesort(edgeadd,3))=1;
% ireceivers=dtoEdgeTable.EndNodes(ismember(dtoEdgeTable.EndNodes(:,1),...
% unique(potnodes(edgesort(edgeadd,4)))),:);
ireceivers=dtoEdgeTable.EndNodes(ismember(dtoEdgeTable.EndNodes(:,1), ...
dtorefvec(edgesort(edgeadd,4))),:);
% addind=sub2ind(size(dtoSLRISK),ireceivers(:,1),ireceivers(:,2));
send_row=[];
rec_col=[];
for jj=1:length(ireceivers(:,1))
send_row=[send_row; find(ismember(dtorefvec,ireceivers(jj,1))==1)];
rec_col=[rec_col; find(ismember(dtorefvec,ireceivers(jj,2))==1)];
end
addind=sub2ind(size(dtoSLRISK),send_row,rec_col);
subroutepref(addind)=1;
subroutepref(rec_col,length(dtorefvec))=1;
% if length(unique(edgesort(edgeadd,4))) == length(potnodes)
% % if edge is selected to send, then at least one of the sending
% % edges of the new node must be activated
%
% else
% subroutepref(edgesort(edgeadd,3))=1;
% end
end
end
newroutepref=subroutepref;