資源簡介
采用遺傳算法實現CVRP問題,用matlab實現,優化目標是運輸成本最低
代碼片段和文件信息
path=children(iL1:L2-1);
L=length(path);
data(path3);
sum(data(path3));
for?k=1:L
????if?k==1
????????fitness_value_c(i)=fitness_value_c(i)+sum(data(path3))*dis(1path(1))*3;
????else
????????fitness_value_c(i)=fitness_value_c(i)+sum(data(path(k:L)3))*dis(path(k-1)path(k))*3;
????end
????????
end?
fitness_value_c(i)=fitness_value_c(i)+dis(path(L)1)*2;
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????372??2018-01-07?21:11??fitness_c.m
?????文件????????335??2018-01-07?21:11??fitness_P.m
?????文件???????4552??2018-05-16?16:33??GAVRP.m
?????文件???????1415??2018-01-08?09:39??jiaocha.m
?????文件???????1119??2018-05-16?15:44??location.m
?????文件???????1222??2018-05-16?15:48??location.mat
-----------?---------??----------?-----??----
?????????????????9015????????????????????6
- 上一篇:最小二乘濾波RLS
- 下一篇:提取一幅圖像的邊緣,基于matlab
評論
共有 條評論