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.

NumberInstance Solution
Best KnownBPRLGWFOHOur CW

1E-n51-k5416.06416.1416.06416.06416.06416.06
2E-n76-k10567.14574.5567.14567.14567.14567.14
3E-n101-k8639.74641.6641.76639.74639.74642.36
4F-n72-k4177.00177.4177.00177.00178.09177.00
5F-n135-k7769.66781.2770.17769.66769.66775.80

NumberInstance CPU time (seconds)
BPRLGWFOHOur CW

1E-n51-k588.82306.217.636.154
2E-n76-k10167.553031.329.068.917
3E-n101-k8325.3128039.5239.682.387
4F-n72-k4398.1104019.5140.242.554
5F-n135-k71000.23590158.21237.5112.258

Bold number indicates the best known solution was obtained.