can anybody verify this code example,
i have bi-ojective function and wish to sort non-dominated solution. This program is running but again if any error or problem then Please help to correct the existing code or send any example please.
clc
clear
nPop=5;
for k=1:nPop;
pop(k).Cost(:,1)=(2*sin(rand));
pop(k).Cost(:,2)=(5*sin(rand));
end
for l=1:nPop
pop(l).Dominated=false;
end
for i=1:nPop-1
for j=i+1:nPop
x=pop(i).Cost;
y=pop(j).Cost;
if all(x
NSGA II code is available at the following site:
http://www.mathworks.com/matlabcentral/fileexchange/10429-nsga-ii--a-multi-objective-optimization-algorithm
NSGA II code is available at the following site:
http://www.mathworks.com/matlabcentral/fileexchange/10429-nsga-ii--a-multi-objective-optimization-algorithm
The following articles may be useful.
http://sci2s.ugr.es/sites/default/files/files/Teaching/OtherPostGraduateCourses/MasterEstructuras/bibliografia/Deb_NSGAII.pdf
http://vision.ucsd.edu/~sagarwal/nsga2.pdf
Dear Mr. Kumar,
The following MATLAB code for nondominated sorting that I used in biobjective optimization, I hope it is useful for you.
%%%%%%%%%%%%% Nondominated Ranking %%%%%%%%%%%%%%%%%%%%%%%%%%%%%
rk=1; %No. of rank
e=0; %Counter for nondominated ranking sorted_f1, sorted_f2 and
%set
ee=0; %Counter for counting the number of solutions have the
%same rank
Q=length(ff1); %To specify the length of ff1
sorted_f1=zeros(1,Q); %To create the sorted_f1 vector to store
%the nondominated sorting f1
sorted_f2=zeros(1,Q); %To create the sorted_f2 vector to store
%the nondominated sorting f2
set=zeros(D,Q); %To create the set matrix to store the
%nondominated sorting population
I=zeros(1,Q); %To create vector I to specify the index of
%solution that belong to the rank level rk
N=zeros(1,Q); %To create vector N to store the number of
%solutions those belong to the rank level rk
while Q~=0
Sc_fitness1=ff1(1,1);
Sc_fitness2=ff2(1,1);
Rank_Sc=rk;
e=e+1;
ee=ee+1;
sorted_f1(1,e)=Sc_fitness1;
ff1(1)=[]; %To truncate the first solution in ff1
sorted_f2(1,e)=Sc_fitness2;
ff2(1)=[]; %To truncate the second solution in ff2
set(:,e)=p(:,1); %To copy the first solution to set matrix
p(:,1)=[]; %To truncate the first solution in p
Population=p(:,:); %Save p matrix in population matrix to
%deal with it for the remainder steps
Fitness1=ff1; %To save ff1 in Fitness1 to deal with it for
%the remainder steps
Fitness2=ff2; %To save ff2 in Fitness2 to deal with it for
%the remainder steps
for i=1:Q-1
Sn_fitness1=Fitness1(1,i);
Sn_fitness2=Fitness2(1,i);
if (Sc_fitness1==Sn_fitness1) && (Sc_fitness2==Sn_fitness2)
Rank_Sn=rk;
e=e+1;
ee=ee+1;
sorted_f1(1,e)=Sn_fitness1;
sorted_f2(1,e)=Sn_fitness2;
set(:,e)=Population(:,i);
I(1,e)=i; %To store the index of solution
elseif Sn_fitness2
Thanks Dhiaa, surely i will see and will communicate if any prob occurs.Thanks again.
- Badges
- Science topic