求帮助！！！物流配送路径优化（选址）问题
本帖最后由 boie 于 2013-5-18 14:54 编辑急求帮助！！！
编程存在问题，用遗传算法，每次结果差异很大，约束也不能一一实现,求帮助啊~~~~
（此问题用lingo是可以求出来的）本人刚学1stopt，所以编的比较笨，求指导啊~~~
Parameters Y(1:4)=,x(1:6,1:4)=,z(1:4,1:2)=;
Constant t1(1:6,1:4)=[5,20,9,30,
9,5,10,25,
16,11,5,10,
25,19,9,13,
26,22,19,5,
35,23,26,9];
Constant t2(1:4,1:2)=[5,20,
26,9,
20,7,
23,30];
Constant m(1:4)=;
Constant f(1:4)=;
Constant b(1:6,1:4)=[10,35,16,40,
16,10,17,32,
25,19,10,17,
30,26,16,23,
32,32,26,10,
43,30,37,16];
Constant s(1:6)=;
Constant p(1:4)=;
Constant d(1:2)=;
MinFunction sum(i=1:6)(sum(j=1:4)(t1*x*Y+0.05*b*Y))+sum(j=1:4)(sum(k=1:2)(t2*z*Y))+sum(j=1:4)(f*Y)+sum(j=1:4)(m*L*Y);
for(k=1:2)(sum(j=1:4)(z)<d); !!!!!!我输的是x【i】可是保存之后看到的没有【i】
for(j=1:4)(sum(i=1:6)(x*Y)<=p);
sum(j=1:4)(Y)=3;
for(i=1:6)(sum(j=1:4)(x*Y)=s);
for(j=1:4)(sum(k=1:2)(z)=L*0.9);
for(j=1:4)(sum(i=1:6)(x*Y)=L);
页:
[1]