📄 result.txt
字号:
-----------------------------------------------------
-----------------------2008年04级信工韩红轲毕业设计--------------------------
------------------------<<蚁群算法解决带时间窗的车辆调度问题>>------------------
tau0=0.0333333
各个点的需求量g[i]为:
0 2 1.5 4.5 3 1.5 4 2.5 3
其中最小的需求量是第2点,需求量是1.5
按时间窗最晚时间从小到大排序各个点的编号为:
0 3 1 8 5 6 2 4 7
[0,0] [1,2] [1,4] [1.5,4] [3,5] [2,5] [4,6] [4,7] [5,8]
各个任务之间的距离矩阵D[I][J]:
0 40 60 75 90 200 100 160 80
40 0 65 40 100 50 75 110 100
60 65 0 75 100 100 75 75 75
75 40 75 0 100 50 90 90 150
90 100 100 100 0 100 75 75 100
200 50 100 50 100 0 70 90 75
100 75 75 90 75 70 0 70 100
160 110 75 90 75 90 70 0 100
80 100 75 150 100 75 100 100 0
第0次迭带
蚂蚁所寻找到的路径各个边上的具体信息为:
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->3 length:75 3->4 length:100 4->0 length:90
该车所走路径长度为:950
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->3 length:75 3->4 length:100 4->0 length:90
该车所走路径长度为:950
第0只蚂蚁所走的路线为: 0 3 5 2 0 6 7 0 8 4 1 0 0 0 0 0
该蚂蚁走的总路径长度为:935 所用总的车辆数为:3
第1只蚂蚁所走的路线为: 0 5 7 4 0 6 2 1 0 8 3 0 0 0 0 0
该蚂蚁走的总路径长度为:1040 所用总的车辆数为:3
第2只蚂蚁所走的路线为: 0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
该蚂蚁走的总路径长度为:805 所用总的车辆数为:3
第3只蚂蚁所走的路线为: 0 8 5 7 0 6 2 1 0 3 4 0 0 0 0 0
该蚂蚁走的总路径长度为:950 所用总的车辆数为:3
第4只蚂蚁所走的路线为: 0 3 5 2 0 6 7 0 8 4 1 0 0 0 0 0
该蚂蚁走的总路径长度为:935 所用总的车辆数为:3
第5只蚂蚁所走的路线为: 0 5 7 4 0 6 2 1 0 8 3 0 0 0 0 0
该蚂蚁走的总路径长度为:1040 所用总的车辆数为:3
第6只蚂蚁所走的路线为: 0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
该蚂蚁走的总路径长度为:805 所用总的车辆数为:3
第7只蚂蚁所走的路线为: 0 8 5 7 0 6 2 1 0 3 4 0 0 0 0 0
该蚂蚁走的总路径长度为:950 所用总的车辆数为:3
the best tour:
0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
car_num=3 best_len=805
找到的最好路径中到达的各个时间值分别为:
0->6 overtime:2
6->7 overtime:5.9
7->2 overtime:10.4
不符合时间窗的点7->2 但该点是通过计算惩罚值可以接受的点
2->0 overtime:13.6
0->8 overtime:1.6
8->5 overtime:3.9
5->4 overtime:7.9
不符合时间窗的点5->4 但该点是通过计算惩罚值可以接受的点
4->0 overtime:11.7
0->3 overtime:1.5
3->1 overtime:3.3
1->0 overtime:5.1
0->0 overtime:0
time used:0.125seconds
第1次迭带
蚂蚁所寻找到的路径各个边上的具体信息为:
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->4 length:75 4->0 length:90 0->3 length:75 3->1 length:40 1->2 length:65 2->0 length:60
该车所走路径长度为:910
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->4 length:75 4->0 length:90 0->3 length:75 3->1 length:40 1->2 length:65 2->0 length:60
该车所走路径长度为:910
第0只蚂蚁所走的路线为: 0 3 5 2 0 6 7 0 8 4 1 0 0 0 0 0
该蚂蚁走的总路径长度为:935 所用总的车辆数为:3
第1只蚂蚁所走的路线为: 0 5 7 4 0 6 2 1 0 8 3 0 0 0 0 0
该蚂蚁走的总路径长度为:1040 所用总的车辆数为:3
第2只蚂蚁所走的路线为: 0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
该蚂蚁走的总路径长度为:805 所用总的车辆数为:3
第3只蚂蚁所走的路线为: 0 8 5 7 0 6 4 0 3 1 2 0 0 0 0 0
该蚂蚁走的总路径长度为:910 所用总的车辆数为:3
第4只蚂蚁所走的路线为: 0 3 5 2 0 6 7 0 8 4 1 0 0 0 0 0
该蚂蚁走的总路径长度为:935 所用总的车辆数为:3
第5只蚂蚁所走的路线为: 0 5 7 4 0 6 2 1 0 8 3 0 0 0 0 0
该蚂蚁走的总路径长度为:1040 所用总的车辆数为:3
第6只蚂蚁所走的路线为: 0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
该蚂蚁走的总路径长度为:805 所用总的车辆数为:3
第7只蚂蚁所走的路线为: 0 8 5 7 0 6 4 0 3 1 2 0 0 0 0 0
该蚂蚁走的总路径长度为:910 所用总的车辆数为:3
the best tour:
0 6 7 2 0 8 5 4 0 3 1 0 0 0 0 0
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
car_num=3 best_len=805
找到的最好路径中到达的各个时间值分别为:
0->6 overtime:2
6->7 overtime:5.9
7->2 overtime:10.4
不符合时间窗的点7->2 但该点是通过计算惩罚值可以接受的点
2->0 overtime:13.6
0->8 overtime:1.6
8->5 overtime:3.9
5->4 overtime:7.9
不符合时间窗的点5->4 但该点是通过计算惩罚值可以接受的点
4->0 overtime:11.7
0->3 overtime:1.5
3->1 overtime:3.3
1->0 overtime:5.1
0->0 overtime:0
time used:0.218seconds
第2次迭带
蚂蚁所寻找到的路径各个边上的具体信息为:
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->3 length:75 3->4 length:100 4->0 length:90
该车所走路径长度为:950
0->3 length:75 3->5 length:50 5->2 length:100 2->0 length:60 0->6 length:100 6->7 length:70 7->0 length:160 0->8 length:80 8->4 length:100 4->1 length:100 1->0 length:40
该车所走路径长度为:935
0->5 length:200 5->7 length:90 7->4 length:75 4->0 length:90 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->8 length:80 8->3 length:150 3->0 length:75
该车所走路径长度为:1040
0->6 length:100 6->7 length:70 7->2 length:75 2->0 length:60 0->8 length:80 8->5 length:75 5->4 length:100 4->0 length:90 0->3 length:75 3->1 length:40 1->0 length:40
该车所走路径长度为:805
0->8 length:80 8->5 length:75 5->7 length:90 7->0 length:160 0->6 length:100 6->2 length:75 2->1 length:65 1->0 length:40 0->3 length:75 3->4 length:100 4->0 length:90
该车所走路径长度为:950
第0只蚂蚁所走的路线为: 0 3 5 2 0 6 7 0 8 4 1 0 0 0 0 0
该蚂蚁走的总路径长度为:935 所用总的车辆数为:3
第1只蚂蚁所走的路线为: 0 5 7 4 0 6 2 1 0 8 3 0 0 0 0 0
该蚂蚁走的总路径长度为:1040 所用总的车辆数为:3
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -