Skip to content

Update ReplacementUniformity.m #141

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
moreirag wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update ReplacementUniformity.m #141

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
59 changes: 43 additions & 16 deletions PlatEMO/Algorithms/Multi-objective optimization/DWU/ReplacementUniformity.m
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
% evolutionary algorithm, with cardinality |Population|, according to the
% uniformity measure.
%% Start
B.objs = Population.objs;

B.decs = Population.decs;
B.wgts = Weight;
Next = (1:length(Population));
Expand All @@ -33,20 +33,47 @@

% Find xi and xj in NP(non-dominated solutions of Population) with
% maximum wd(xi; xj) (dominance-weighted uniformity function).
ind = Front == 1;
Aux.decs = B.decs(ind,:);
Aux.wgts = B.wgts(ind,:);
[D,I] = distDWU(Aux,Aux,-1);
[~, j] = max(D);
R.decs(ii,:) = B.decs(j,:);
R.wgts(ii,:) = B.wgts(j,:);
ii = ii + 1;
R.decs(ii,:) = B.decs(I(j),:);
R.wgts(ii,:) = B.wgts(I(j),:);
B.decs([j I(j)],:)=[];
B.wgts([j I(j)],:)=[];
Remain = Next([j I(j)]);
Next([j I(j)])=[];
ind = Front == min(Front);
if sum(ind) == 1
Aux.decs = B.decs(ind,:);
Aux.wgts = B.wgts(ind,:);
Aux.next = Next(ind);
%
nFront = Front(~ind);
C.decs = B.decs(~ind,:);
C.wgts = B.wgts(~ind,:);
nNext = Next(~ind);
ind1 = nFront == min(nFront);
Aux.decs = [Aux.decs;C.decs(ind1,:)];
Aux.wgts = [Aux.wgts;C.wgts(ind1,:)];
Aux.next = [Aux.next nNext(ind1)];
[D,I] = distDWU(Aux,Aux,-1);
[~, j] = max(D);
R.decs(ii,:) = Aux.decs(j,:);
R.wgts(ii,:) = Aux.wgts(j,:);
ii = ii + 1;
R.decs(ii,:) = Aux.decs(I(j),:);
R.wgts(ii,:) = Aux.wgts(I(j),:);
B.decs(Aux.next([j I(j)]),:)=[];
B.wgts(Aux.next([j I(j)]),:)=[];
Remain = Next(Aux.next([j I(j)]));
Next(Aux.next([j I(j)]))=[];
else
Aux.decs = B.decs(ind,:);
Aux.wgts = B.wgts(ind,:);
Aux.next = Next(ind);
[D,I] = distDWU(Aux,Aux,-1);
[~, j] = max(D);
R.decs(ii,:) = Aux.decs(j,:);
R.wgts(ii,:) = Aux.wgts(j,:);
ii = ii + 1;
R.decs(ii,:) = Aux.decs(I(j),:);
R.wgts(ii,:) = Aux.wgts(I(j),:);
B.decs(Aux.next([j I(j)]),:)=[];
B.wgts(Aux.next([j I(j)]),:)=[];
Remain = Next(Aux.next([j I(j)]));
Next(Aux.next([j I(j)]))=[];
end

while ii < N
ii = ii + 1;
Expand Down Expand Up @@ -121,4 +148,4 @@
if smallestLargest < 0
D = D * -1;
end
end
end