Research Article

Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Table 7

Comparison of solutions based on different degrees of dynamism.

Problemdod = dod = dod =
BestAverageBestAverageBestAverage

f71284.15334.14 290.74337.56295.82337.61
c50611.97707.99609.32702.87620.12709.72
c751055.601137.401042.20 1128.40 1102.301136.90
c1001096.90 1263.80 1116.501268.901124.001267.50
c100b1009.901065.60 998.401067.10992.41 1068.80
c1201153.401293.60 1152.001303.701137.50 1297.30
c1501574.80 1745.001609.001742.301587.001730.90
c1991955.20 2268.702064.702261.70 2039.002270.60
tai75a1953.702108.001895.50 2105.601957.102083.30
tai75b1575.201677.001490.10 1660.70 1541.901680.70
tai75c1411.501604.201443.101609.601395.10 1591.60
tai75d1533.601668.201418.30 1980.601593.701663.10
tai100a2657.802944.802656.102914.00 2597.60 2914.20
tai100b2367.302616.10 2387.802619.002365.80 2624.70
tai100c1670.50 1860.60 1678.801864.601687.601864.50
tai100d1988.102229.202013.902218.50 1958.802227.50
tai150a3755.30 4210.503777.104220.803800.604206.40
tai150b3363.403661.503273.60 3666.503370.203654.80
tai150c2889.40 3198.502941.703208.802995.003186.20
tai150d3348.603720.20 3296.003752.803175.10 3765.00
Count776677
Prop35%35%30%30%35%35%