Table 7 The code 2

1

DistanV=0;n=size(s,2);

2

for i=1:(n-1)

3

DistanV=DistanV+20*dislist(s(1,i),s(1,i+1));

4

end

5

DistanV=DistanV+20*dislist(s(1,n),s(1,1));

6

P=[]; timecost(1,1)=0; P(1,1)=8;

7

for i=2:n

8

P(1,i)=dislist(s(1,i-1),s(1,i))*20/(at(1,4)*1000)+P(i-1)+0.1;

9

if(zzz(s(1,i),8)<=P(1,i))&&(P(1,i)<=zzz(s(1,i),9))

10

timecost(1,i)=0;

11

if (zzz(s(1,i),8)-P(1,i))<=1

12

timecost(1,i)=(zzz(s(1,i),8) -P(1,i));

13

if (P(1,i)-zzz(s(1,i),9))<=1

14

timecost(1,i)=(P(1,i)-zzz(s(1,i),9));

15

else timecost(1,i)=2;

16

end end end end

17

F=0.35*DistanV+sum(timecost);