資源簡(jiǎn)介
郵政運(yùn)輸網(wǎng)絡(luò)中的郵路規(guī)劃和郵車(chē)調(diào)度 針對(duì)郵政物流配送問(wèn)題建立多目標(biāo)網(wǎng)絡(luò)優(yōu)化模型,通過(guò)聚類(lèi)分析方法化簡(jiǎn)復(fù)雜的郵路網(wǎng)絡(luò),并綜合運(yùn)用圖論中Floyd、Kruskal、TSP等算法高效快捷地解決該問(wèn)題。-The postal transport network the Postman planning and Vehicle Management establish a network of multi-objective optimization model for the postal logistics through cluster analysis simplification complex Postman network and the integrated use of graph theory Floyd, Kruskal TSP algorithm quickly and efficiently resolve the issue.
代碼片段和文件信息
function[Dpath]=floyd(a)
%[Dpath]=floyd(a)
%輸入?yún)?shù)a是求圖的帶權(quán)鄰接矩陣,D(ij)表示i到j(luò)的最短距離path(ij)ij之間最短路徑上頂點(diǎn)i的后繼點(diǎn)
n=size(a1);
D=a;
for?i=1:n
???for?j=1:n
?????path(ij)=j;
???end
end
for?k=1:n
???for?i=1:n
??????for?j=1:n
?????????if?D(ik)+D(kj) ????????????D(ij)=D(ik)+D(kj);
????????????path(ij)=path(ik);
?????????end
??????end
???end
end
?屬性????????????大小?????日期????時(shí)間???名稱(chēng)
-----------?---------??----------?-----??----
?????目錄???????????0??2013-05-12?11:29??郵路規(guī)劃問(wèn)題\
?????文件?????????409??2012-08-23?22:36??郵路規(guī)劃問(wèn)題\floyd.m
?????文件?????????752??2012-08-23?17:10??郵路規(guī)劃問(wèn)題\Kruskal.m
?????文件?????????457??2012-08-24?13:54??郵路規(guī)劃問(wèn)題\long_circle.m
?????文件?????????441??2012-08-23?20:42??郵路規(guī)劃問(wèn)題\modifycircle.m
?????文件?????????510??2012-08-23?14:36??郵路規(guī)劃問(wèn)題\PreData.m
?????文件????????3272??2012-08-25?22:00??郵路規(guī)劃問(wèn)題\question1.m
?????文件????????1245??2012-08-24?13:52??郵路規(guī)劃問(wèn)題\question2_1.m
?????文件????????3534??2012-08-25?16:44??郵路規(guī)劃問(wèn)題\question2_2.m
?????文件?????????889??2012-08-24?14:55??郵路規(guī)劃問(wèn)題\question4_1.m
?????文件????????2115??2012-08-25?16:47??郵路規(guī)劃問(wèn)題\question4_2.m
?????文件??????125952??2012-08-24?18:32??郵路規(guī)劃問(wèn)題\shuju1.xls
?????文件????????2474??2012-08-25?20:39??郵路規(guī)劃問(wèn)題\vrp_cost.m
?????文件???????36352??2007-10-18?19:42??郵路規(guī)劃問(wèn)題\附件?郵局間直達(dá)公路里程.xls
評(píng)論
共有 條評(píng)論