資源簡介
本文用貪婪算法和最小路徑算法解決TSP問題,包含源代碼,并且已經調試過了,可以使用

代碼片段和文件信息
num=6;
s=zeros(1num);
s(1)=1;?t=zeros(1num);
t(2:num)=1;
distance=[0?7?45?21?53?19;7?0?14?17?21?18;45?14?0?24?34?25;21?17?24?0?35?16;53?21?34?35?0?8;19?18?25?16?8?0]
trace=zeros(numnum);
results=zeros(1num);
time=1;
while?time<=num-1
????a=1;?
????h=9999;
????i=1;
????while?i<=num
????????if?s(i)==1
????????????j=1;
????????????while?j<=num
???????????????if?t(j)==1
???????????????????h=min(results(i)+distance(ij)h);
???????????????end
???????????????j=j+1;
????????????end
????????end
????????i=i+1;
????end
????i=1;
????while?i<=num
????????if?s(i)==1
????????????j=1;
????????????while?j<=num
???????????????if?t(j)==1
???????????????????if?results(i)+distance(ij)==h
???????????????????????if?a==1????
???????????????????????trace(aj)=i;
???????????????????????results(j)=h;
???????????????????????s(j)=1;
???????????????????????t(j)=0;
???????????????????????a=a+1;
???????????????????????else
???????????????????????time=time+1;
???????????????????????trace(aj)=i;
???????????????????????results(j)=h;
???????????????????????s(j)=1;
???????????????????????t(j)=0;
???????????????????????a=a+1;
???????????????????????end
???????????????????end
???????????????end
???????????????j=j+1;
????????????end
????????end
????????i=i+1;
????end
????time=time+1;
end
trace
results
s
break
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1354??2015-01-16?12:45??貪婪算法和最小路徑法解決TSP問題\現代優化作業\dijkasjila.m
?????文件??????93547??2015-01-15?21:09??貪婪算法和最小路徑法解決TSP問題\現代優化作業\dijksjila.docx
?????文件???????1833??2015-01-19?10:16??貪婪算法和最小路徑法解決TSP問題\現代優化作業\dongying.m
?????文件????????974??2015-01-16?21:36??貪婪算法和最小路徑法解決TSP問題\現代優化作業\Locsearch.m
?????文件???????1601??2015-01-19?15:37??貪婪算法和最小路徑法解決TSP問題\現代優化作業\nearest.m
?????文件????????974??2015-01-19?12:26??貪婪算法和最小路徑法解決TSP問題\現代優化作業\nearest1.m
?????文件???????1838??2015-01-17?21:32??貪婪算法和最小路徑法解決TSP問題\現代優化作業\shishi.asv
?????文件???????1838??2015-01-17?21:35??貪婪算法和最小路徑法解決TSP問題\現代優化作業\shishi.m
?????文件???????1613??2015-01-18?20:08??貪婪算法和最小路徑法解決TSP問題\現代優化作業\tanlan.asv
?????文件???????1612??2015-01-18?20:10??貪婪算法和最小路徑法解決TSP問題\現代優化作業\tanlan.m
?????文件????????859??2015-01-16?12:35??貪婪算法和最小路徑法解決TSP問題\現代優化作業\Unti
?????文件???????1702??2015-01-16?21:45??貪婪算法和最小路徑法解決TSP問題\現代優化作業\Unti
?????文件???????1920??2015-01-18?19:57??貪婪算法和最小路徑法解決TSP問題\現代優化作業\Unti
?????文件????????335??2015-01-18?19:57??貪婪算法和最小路徑法解決TSP問題\現代優化作業\Unti
?????文件????1218661??2015-01-19?10:56??貪婪算法和最小路徑法解決TSP問題\現代優化作業\一種改進的模擬退火算法在TSP問題中的研究與應用_辛振銘.caj
?????文件?????159979??2015-01-19?08:50??貪婪算法和最小路徑法解決TSP問題\現代優化作業\東哥.docx
?????文件??????13672??2015-01-17?20:17??貪婪算法和最小路徑法解決TSP問題\現代優化作業\作業.docx
?????文件??????16618??2015-01-18?20:50??貪婪算法和最小路徑法解決TSP問題\現代優化作業\作業3.docx
?????文件????2622874??2015-01-19?10:51??貪婪算法和最小路徑法解決TSP問題\現代優化作業\免疫算法和模擬退火算法求解TSP問題的研究_吳進波.caj
?????文件??????12086??2015-01-19?15:30??貪婪算法和最小路徑法解決TSP問題\現代優化作業\封面.docx
????..A.SH.???????162??2015-01-19?15:31??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業\~$3模擬退火算法.docx
?????文件??????25254??2015-01-19?15:31??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業\作業1.docx
?????文件??????19742??2015-01-19?15:38??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業\作業2.docx
?????文件??????46660??2015-01-19?15:33??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業\作業3模擬退火算法.docx
?????文件??????24064??2015-01-04?09:19??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業\現代優化作業.doc
?????文件???????1552??2015-01-17?21:41??貪婪算法和最小路徑法解決TSP問題\現代優化作業\貪婪.asv
?????文件???????2559??2015-01-16?21:00??貪婪算法和最小路徑法解決TSP問題\現代優化作業\貪婪算法.m
?????文件??????25915??2015-01-16?21:36??貪婪算法和最小路徑法解決TSP問題\現代優化作業\貪婪結果.docx
?????文件?????154455??2015-01-19?10:56??貪婪算法和最小路徑法解決TSP問題\現代優化作業\車輛路徑問題的模擬退火算法_胡大偉.pdf
?????目錄??????????0??2015-11-27?19:16??貪婪算法和最小路徑法解決TSP問題\現代優化作業\現代優化作業
............此處省略5個文件信息
- 上一篇:多目標優化算法
- 下一篇:利用matlab繪制一個簡易的地鐵運行圖多交路共線模式
評論
共有 條評論