In this group of experiments, we tested the four algorithms on a group of random graphs with different delay bounds.
GRASP-VNS Tree Cost = 811, Tree Delay = 8, Computing time = 3.109 s
GRASP-CST Tree Cost = 867, ?Tree Delay = 8, Computing time = 0.359 s
Multi-VNS Tree Cost = 825, Tree Delay = 8, Computing time = 4.703 s
VNSMR2 Tree Cost = 851, Tree Delay = 8, Computing time = 1.125 s
2. Random Graph Network Size = 100, Delay bound = 12
GRASP-VNS Tree Cost = 1095, Tree Delay = 10, Computing time = 32.734 s
GRASP-CST Tree Cost = 1154, Tree Delay = 11, computing time = 4.61 s
Multi-VNS Tree Cost = 1097, Tree Delay = 11, Computing time = 28.891 s
VNSMR2 Tree Cost = 1097, Tree Delay = 11, Computing time = 15.172 s
