公交车调度模型.doc

公交车调度模型 (故可视作环行线，见下图) 记 v：公交车速度； t(k)： 第k次发车时刻（k=1,2,……，N）； d(j)： 第Bj站到第Bj+1站的距离(km)（j=1,2,……,25）； t1(k,j)：第k次发车到达第j站的时刻：t1(k,j)=t(k)+[d(1)+d(2)+……+d(j))]/v; (j=2,……,26) T： 公交车环行周期（h）； mu：矩阵元素mu(i,j)为第i个时间段第j个站上车人数(i=1,2,……,18, j=1,2,……,26)； md：矩阵元素md(i,j)为第i个时间段第j个站下车人数(i=1,2,……,18, j=1,2,……,26)；； z(k,j)： 第k次发车第j个站启车时乘客增量：z(k,j)=f(t(k),j)×[t(k,j)-t(k-1,j)]( j=1,2,……,25)；其中 s(k,j)：第k次发车第j站启车时车上乘客数 s(k,j)=[z(k,1)+ z(k,2)+……＋z(k,j)] ( j=1,2,……,25); 优化模型 目标函数：max t(k) 约束条件： sets: fache/1/:t; distance/1..25/:d; time_stage/1..18/; zhan/1..26/:i0,i1,i3; link1(time_stage,zhan):mu,md; link(fache,zhan):f,s,z; !link2(fache,time_stage):tj,z; endsets data: v=20; d=1.56,1,0.44,1.2,0.97,2.29,1.3,2,0.73,1,0.5,1.62,1.6,0.5,1,0.73,2.04,1.26,2.29,1,1.2,0.4,1,1.03,0.53; mu=22,3,4,2,4,4,3,3,3,1,1,0,371,60,52,43,76,90,48,83,85,26,45,45,11,0 795,143,167,84,151,188,109,137,130,45,53,16,1990,376,333,256,589,594,315,622,510,176,308,307,68,0, 2328,380,427,224,420,455,272,343,331,126,138,45,3626,634,528,447,948,868,523,958,904,259,465,454,99,0, 2706,374,492,224,404,532,333,345,354,120,153,46,2064,322,305,235,477,549,271,486,439,157,275,234,60,0, 1556,204,274,125,235,308,162,203,198,76,99,27,1186,205,166,147,281,304,172,324,267,78,143,162,36,0, 902,147,183,82,155,206,120,150,143,50,59,18,923,151,120,108,215,214,119,212,201,75,123,112,26,0, 847,130,132,67,127,150,108,104,107,41,48,15,957,181,157,133,254,264,135,253,260,74,138,117,30,0, 706,90,118,66,105,144,92,95,88,34,40,12,873,141,140,108,215,204,129,232,221,65,103,112,26,0, 770,97,126,59,102,133,97,102,104,36,43,13,779,141,103,84,186,185,103,211,173,66,108,97,23,0, 839,133,156,69,130,165,101,118,120,42,49,15,625,104,108,82,162,180,90,185,170,49,75,85,20,0, 1110,170,189,79,169,194,141,152,166,54,64 ,9,635,124,98,82,152,180,80,185,150,49,85,85,20,0, 1837,260,330,146,305,404,229,277,253,95,122,34,1493,299,240,199,396,404,210,428,390,120,208,197,49,0, 3020,474,587,248,468,649,388,432,452,157,205,56,2011,379,311