数学建模lingo求路径最小
m=3;
timea=14143251.5;
timeb=46275.52.584;
q=21.54.531.542.53;
s=121322.530.8;
capacity=8;
time_between=00.81.21.51.8423.21.6
0.801.30.8211.52.22
1.21.301.5221.51.51.5
1.50.81.50211.81.83
1.8222021.51.52
4121201.41.81.5
21.51.51.81.51.401.42
3.22.21.51.81.51.81.402
1.621.5321.5220;
enddata
min=@sum(roads(i,j):
dist(i,j)*
@sum(cars(k):
x(i,j,k)));
@for(road_car:@bin(x));
@for(task_car:@bin(y));
@for(task_aim:@bin(y1));
@sum(point_aim(i):从这里不好使
q(i)*@sum(cars(k)|k#eq#1:
y1(i,k)))