Research Article
A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem
Table 5
Computational results between the proposed CW and the other algorithms for data sets E and F.
| Number | Instance |
Solution | Best Known | B | PR | LGW | FOH | Our CW |
| 1 | E-n51-k5 | 416.06 | 416.1 | 416.06 | 416.06 | 416.06 | 416.06 | 2 | E-n76-k10 | 567.14 | 574.5 | 567.14 | 567.14 | 567.14 | 567.14 | 3 | E-n101-k8 | 639.74 | 641.6 | 641.76 | 639.74 | 639.74 | 642.36 | 4 | F-n72-k4 | 177.00 | 177.4 | 177.00 | 177.00 | 178.09 | 177.00 | 5 | F-n135-k7 | 769.66 | 781.2 | 770.17 | 769.66 | 769.66 | 775.80 |
| Number | Instance | |
CPU time (seconds) | | B | PR | LGW | FOH | Our CW |
| 1 | E-n51-k5 | | 88.8 | 230 | 6.2 | 17.6 | 36.154 | 2 | E-n76-k10 | | 167.5 | 530 | 31.3 | 29.0 | 68.917 | 3 | E-n101-k8 | | 325.3 | 1280 | 39.5 | 239.6 | 82.387 | 4 | F-n72-k4 | | 398.1 | 1040 | 19.5 | 140.2 | 42.554 | 5 | F-n135-k7 | | 1000.2 | 3590 | 158.2 | 1237.5 | 112.258 |
|
|
Bold number indicates the best known solution was obtained.
|