%擁擠距離的計算矩陣行中前n個為變量值，第n+1：n+m個為函數值，第n+m+1個記錄rank值，第n+m+2個記錄擁擠距離
function?nsdcpop=crowding_distance（popmnrank_info）
[xsizeysize]=size（pop）;
index=0;%存儲每次rank等級開始個體所在位置
pop（:m+n+2）=0;%用于存儲cd值
for?i=1:length（rank_info）
????for?j=1:m
????????[temp?index_sort]=sort（pop（index+1:index+rank_info（i）n+j））;%排序
????????index_sort=index_sort+index;%記錄排序的位置
???????for?k=1:rank_info（i）
???????????newpos=find（index_sort==index+k）;%找到個體k排序后的位置，然后求取聚焦距離
???????????if?（newpos==1?||?newpos==rank_info（i））
????????????????pop（index+km+n+2）=inf;
???????????else
???????????????pre_person_index=index_sort（newpos+1）;
???????????????next_person_index=index_sort（newpos-1）;
???????????????pop（index+km+n+2）=pop（index+km+n+2）+（pop（pre_person_indexn+j）-pop（next_person_indexn+j））;
???????????end
???????end
????end
????index?=index+rank_info（i）;
end
nsdcpop=pop;
end

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件????????967??2018-05-14?21:56??DNSGA-II\crowding_distance.m

?????文件????????808??2018-05-13?21:07??DNSGA-II\crowding_distance_assignment.m

?????文件????????488??2018-05-13?21:28??DNSGA-II\elitist_strategy.m

?????文件????????977??2018-05-14?22:03??DNSGA-II\generate_offsprings.m

?????文件???????1521??2018-05-14?11:13??DNSGA-II\genetic_operate.m

?????文件???????2187??2018-05-14?21:58??DNSGA-II\non_dominant_sort.m

?????文件???????1252??2018-04-22?19:46??DNSGA-II\non_dominated_sort.m

?????文件???????4601??2018-06-17?12:19??DNSGA-II\NSGA_II.asv

?????文件???????4904??2018-06-17?12:47??DNSGA-II\NSGA_II.m

?????文件???????3085??2018-05-14?11:08??DNSGA-II\Untitled2.m

?????文件???????1680??2018-06-17?12:39??DNSGA-II\value.asv

?????文件???????1702??2018-06-17?12:45??DNSGA-II\value.m

?????文件??????57182??2015-04-08?22:24??DNSGA-II\ZDT6.txt

?????目錄??????????0??2018-06-23?17:04??DNSGA-II

-----------?---------??----------?-----??----

????????????????81354????????????????????14