資源簡介
粒子群算法解決經典的TSP問題,自己做的,測試不錯,可以用
代碼片段和文件信息
function?dist=dist(xD)
n=size(x2);
dist=0;
for?i=1:n-1
????dist=dist+D(x(i)x(i+1));
end
dist=dist+D(x(1)x(n));
????
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????????835??2020-09-23?03:53??┴ú╫╙╚║╦π╖?PSO\berlin52.txt
?????文件?????????126??2020-09-23?03:53??┴ú╫╙╚║╦π╖?PSO\dist.m
?????文件?????????419??2020-09-23?03:53??┴ú╫╙╚║╦π╖?PSO\fitness.m
?????文件????????5736??2020-09-23?03:53??┴ú╫╙╚║╦π╖?PSO\main.m
評論
共有 條評論