%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%??MATLAB?Code?for??????????????????????????????????????????????%
%???????????????????????????????????????????????????????????????%
%??Non-dominated?Sorting?Genetic?Algorithm?II?（NSGA-II）?????????%
%??Version?1.0?-?April?2010?????????????????????????????????????%
%???????????????????????????????????????????????????????????????%
%??Programmed?By:?S.?Mostapha?Kalami?Heris??????????????????????%
%???????????????????????????????????????????????????????????????%
%?????????e-Mail:?sm.kalami@gmail.com???????????????????????????%
%?????????????????kalami@ee.kntu.ac.ir??????????????????????????%
%???????????????????????????????????????????????????????????????%
%???????Homepage:?http://www.kalami.ir??????????????????????????%
%???????????????????????????????????????????????????????????????%
%??BinaryTournamentSelection.m?:?implelemnts?binary?tournament??%
%????????????????????????????????selection實現二進制比賽選擇?????%
%????????????????????????????????選擇操作???????????????????????%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

function?p=BinaryTournamentSelection（pop）
%計算擁擠度之后的pop
%p：要么是1要么是2?
%?在錦標賽選擇過程中，隨機選擇n個人，其中n等于|?tour_size?|。?從這些個體中只選擇
%?一個，并將其添加到交配池中，交配池的大小為|?pool_size?|。?根據兩個標準進行選擇
%?。?首先是解決方案所在的等級或前沿。?選擇排名較低的個人。?其次，如果兩個人的排名
%?相同，則比較擁擠距離。?擁擠距離較大的人選擇。
????npop=numel（pop）;
????
????i=randi（[1?2][1?npop]）;????%生成均勻分布的偽隨機整數，區間[1?2]1*npop矩陣
????
????p1=pop（i（1））;????%要么是1，要么是2
????p2=pop（i（2））;????%要么是1，要么是2
%誰的非支配排序小用誰????
????if?p1.Rank?????????p=p1;
????elseif?p1.Rank?>?p2.Rank
????????p=p2;
????else
????????if?p1.CrowdingDistance>p2.CrowdingDistance
????????????p=p1;
????????else
????????????p=p2;
????????end
????end

end

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

?????文件???????1973??2017-11-28?10:19??2\BinaryTournamentSelection.m

?????文件???????1926??2017-11-30?11:20??2\CalcCrowdingDistance.m

?????文件???????1264??2017-11-22?11:16??2\Cost.m

?????文件???????1588??2017-11-23?21:55??2\CreateEmptyIndividuals.m

?????文件???????1358??2017-11-24?17:15??2\Crossover.m

?????文件???????1298??2017-11-24?10:27??2\Dominates.m

?????文件???????1277??2017-11-24?10:58??2\GetCosts.m

?????文件???????1317??2013-06-26?16:02??2\Mutate.m

?????文件????????141??2013-09-05?19:26??2\MyCost1.m

?????文件????????121??2013-09-29?13:24??2\MyCost2.m

?????文件????????168??2013-09-05?19:27??2\MyCost3.m

?????文件????????147??2013-09-27?14:30??2\MyCost4.m

?????文件????????163??2013-09-27?14:17??2\MyCost5.m

?????文件????????231??2013-09-05?19:22??2\MyCost6.m

?????文件????????271??2013-09-05?19:21??2\MyCost7.m

?????文件???????1773??2013-06-26?16:02??2\New?Folder\MyCost1.m

?????文件???????3285??2017-11-26?15:16??2\NonDominatedSorting.m

?????文件???????6326??2017-11-30?09:27??2\nsga2.m

?????文件???????1896??2013-10-01?21:14??2\PlotFronts.m

?????文件???????1513??2017-11-24?16:06??2\SortPopulation.m

?????文件????????110??2013-06-26?16:02??2\www.kalami.ir.url

?????目錄??????????0??2017-11-29?22:05??2\New?Folder

?????目錄??????????0??2017-11-30?15:03??2

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

????????????????28146????????????????????23