From: A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem
Instances | #vertices | #vehicles | OPT | AS | VL | HVT | |||
---|---|---|---|---|---|---|---|---|---|
Best.Sol | Best.Sol | Best.Sol | Aver.Sol | \(\hbox {Gap}_1\) | Time | ||||
A034-02f | 34 | 2 | 1406 | 1406 | 1406 | 1406 | 1406.00 | 0.00 | 0.27 |
A036-03f | 36 | 3 | 1644 | 1644 | 1644 | 1644 | 1644.00 | 0.00 | 0.31 |
A039-03f | 39 | 3 | 1654 | 1654 | 1654 | 1654 | 1654.00 | 0.00 | 0.44 |
A045-03f | 45 | 3 | 1740 | 1740 | 1740 | 1740 | 1740.00 | 0.00 | 0.52 |
A048-03f | 48 | 3 | 1891 | 1891 | 1891 | 1891 | 1891.51 | 0.00 | 0.59 |
A056-03f | 56 | 3 | 1739 | 1739 | 1739 | 1739 | 1739.00 | 0.00 | 0.63 |
A065-03f | 65 | 3 | 1974 | 1974 | 1974 | 1976 | 1976.21 | 0.10 | 2.61 |
A071-03f | 71 | 3 | 2054 | 2054 | 2121 | 2054 | 2054.51 | 0.00 | 2.80 |