求大神解答，急！！

快到碗里来

这是我们建模的题目，但是有几条语句好像不好使，结果也不对，求解
是求最短路径的，三辆车
m=3;
timea=1 4 1 4 3 2 5 1.5;
timeb=4 6 2 7 5.5 2.5 8 4;
q=2 1.5 4.5 3 1.5 4 2.5 3;
s=1 2 1 3 2 2.5 3 0.8;
capacity=8;
time_between=0 0.8 1.2 1.5 1.8 4 2 3.2 1.6
0.8 0 1.3 0.8 2 1 1.5 2.2 2
1.2 1.3 0 1.5 2 2 1.5 1.5 1.5
1.5 0.8 1.5 0 2 1 1.8 1.8 3
1.8 2 2 2 0 2 1.5 1.5 2
4 1 2 1 2 0 1.4 1.8 1.5
2 1.5 1.5 1.8 1.5 1.4 0 1.4 2
3.2 2.2 1.5 1.8 1.5 1.8 1.4 0 2
1.6 2 1.5 3 2 1.5 2 2 0;
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)))<=capacity;
@sum(point_aim(i):
q(i)*@sum(cars(k)|k#eq#2:
y1(i,k)))<=capacity;
@sum(point_aim(i):
q(i)*@sum(cars(k)|k#eq#3:
y1(i,k)))<=capacity;
@for(point_aim(i):
@sum(cars(k):
y1(i,k))=1);
@sum(task_car(i,k)|i#eq#1:y(i,k))=m;
@for(points(j)|j#ne#1:
@sum(points(i):
@sum(cars(k):x(i,j,k)))=1);
@for(points(p):
@sum(points(i)|i#ne#p:
@sum(cars(k):
x(i,p,k)))=1;
@sum(points(j)|j#ne#p:
@sum(cars(k):
x(p,j,k)))=1;
);
@for(reach(i):time_reach(i)>@sum(point_aim(i):timea(i)));
@for(reach(j):time_reach(j)<@sum(point_aim(j):timeb(j)));
end

wujianjack2

  如果单是求解最短路问题，可以考虑动态规划和0-1规划，参见《LINGO与Excel在数学中的作用》p71-p75，或者《优化建模与LINDO/LINGO软件》p2864-p287，这两本书论坛上有，楼主可以下载看看，个人也觉得也是学习LINGO的好书。
  楼主的问题欠完整，如果方便的话可以说得更加清楚些，包括模型与程序代码，这样更方便大家帮助你！