Welcome to My Home Page

Comparison of GRASP-VNS, Multi-VNS, GRASP-CST and VNSMR2 for Steiner Tree problems in the OR-library

In this group of experiments, we tested the four algorithms on the steinb problems with different delay bounds.

GRASP-VNS

Tree cost = 122, Tree Delay = 255, Computing time = 5s

GRASP-CST

Tree Cost = 125, Tree Delay = 221, Computing time = 1.016s

Multi-VNS

Tree Cost = 124, Tree Delay = 264, Computing time = 3.625 s

VNSMR2

Tree Cost = 124, Tree Delay = 264, Computing time = 1.156 s

2. Steinb18
Network Size = 100, Delay bound = 348

GRASP-VNS

Tree Cost = 219, Tree Delay = 287, Computing time = 38.047 s

GRASP-CST

Tree Cost = 220, Tree Delay = 283, Computing time = 12.469 s

Multi-VNS

Tree Cost = 219, Tree Delay = 287, Computing time = 29.781 s

VNSMR2

Tree Cost = 219, Tree Delay = 287, Computing time = 19.359 s