Welcome to My Home Page




VNS with different initialisations (some examples)

The first set of experiments is designed to investigate the performance of VNSMR with two different initialization heuristics, e.g. VNSMR0 with DKSLD, VNSMR1 with DBDDSP. Both variants have the same neighborhood structures. We randomly generate 20 different network topologies for each size of 20, 50, 100, 200 and 300 networks. For each network topology, the source node and the destination nodes are randomly selected.

1.Network size = 20, Group size = 10

1

Inital solution 1(DKSLD) (Tree Cost = 827.00, Time = 0s)

2

Initial solution 2 (DBDDSP) (Tree Cost = 484.00, Time = 0s)

test1

VNSMR0 (Tree Cost = 486.00, Time = 0.016s)

test

VNSMR1 (Tree Cost = 420.00, Time = 0.016s)

2.Network Size = 100, Group Size = 10

1

Inital solution 1(DKSLD) (Tree Cost = 1316, Time = 0.094s)

2

Initial solution 2 (DBDDSP) (Tree Cost = 833, Time = 0s)

3

VNSMR0 (Tree Cost = 689, Time = 1.453s)

VNSMR1 (Tree Cost = 647, Time = 0.6733s)

3.Network Size = 200, Group Size = 10

1

Initial solution 1(DKSLD) (Tree Cost = 1768, Time = 0.422s)

2

Initial solution 2(DBDDSP) (Tree Cost = 1068, Time = 0.016s)

3

VNSMR0 (Tree Cost = 852, Time = 20.985s)

4

VNSMR1 (Tree Cost = 764, Time = 8.813s)

4.Network Size = 50, Group Size = 5

1

Initial solution 1(DKSLD) (Tree Cost = 460, Time = 0s)

2

Initial solution 2(DBDDSP) (Tree Cost = 226, Time = 0s)

3

VNSMR0 (Tree Cost = 213, Time = 0.031s)

4

VNSMR1 (Tree Cost = 184, Time = 0.031s)

1

Initial solution 1(DKSLD) (Tree Cost = 755, Time = 0.016s)

2

Initial solution 2(DBDDSP) (Tree Cost = 528, Time = 0s)

3

VNSMR0 (Tree Cost = 537, Time = 0.094s)

4

VNSMR1 (Tree Cost = 477, Time = 0.11s)






  这个模版来自http://BestMoban.Com,更多模版请访问http://BestMoban.Com http://Moban.17Easy.Com http://www.mb8.cn