matlab里fno,非支配排序算法通用MATLAB代码

function [FrontNO,MaxFNO] = NDSort(PopObj,nSort)

%NDSort - Do non-dominated sorting on the population by ENS

%

% FrontNO = NDSort(A,s) does non-dominated sorting on A, where A is a

% matrix which stores the objective values of all the individuals in the

% population, and s is the number of individuals being sorted at least.

% FrontNO(i) means the number of front of the i-th individual.

%

% [FrontNO,K] = NDSort(...) also returns the maximum number of fronts,

% except for the value of inf.

%

% In particular, s = 1 stands for find only the first non-dominated

% front, s = size(A,1)/2 stands for sort only half of the population

% (which is often used in the algorithm), and s = inf stands for sort the

% whole population.

%

% Example:

% [FrontNO,MaxFNO] = NDSort(PopObj,1)

[N,M] = size(PopObj);

FrontNO = inf(1,N);

MaxFNO = 0;

[PopObj,rank] = sortrows(PopObj);

while sum(FrontNO

MaxFNO = MaxFNO + 1;

for i = 1 : N

if FrontNO(i) == inf

Dominated = false;

for j = i-1 : -1 : 1

if FrontNO(j) == MaxFNO

m = 2;

while m <= M && PopObj(i,m) >= PopObj(j,m)

m = m + 1;

end

Dominated = m > M;

if Dominated || M == 2

break;

end

end

end

if ~Dominated

FrontNO(i) = MaxFNO;

end

end

end

end

FrontNO(rank) = FrontNO;

end

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值