Skip to main content

Table 2 Results of greedy algorithm and discrete bat algorithm

From: A bat algorithm for SDN network scheduling

Serial number Optimal solution Greedy sequence Greedy solution Ratio Bat sequence Bat solution Ratio
1 19 [1,2,4,5,0,0,1,2,3] 15 78.95% [7,6,4,2,2,0,3,5,1] 17 89.47%
2 23 [3,0,4,1,6,7,5,2,4] 22 91.67% [3,6,2,1,2,7,5,4,2] 23 95.83%
3 27 [6,1,1,0,0,2,4,7,0] 25 89.28% [6,3,4,0,1,2,7,1,0] 27 96.42%
4 15 [1,2,5,0,0,0,2,3,4] 13 81.25% [7,6,2,2,4,0,0,3,5] 14 87.5%
5 24 [3,7,0,2,7,2,4,1,5] 22 78.57% [1,6,2,2,7,1,5,4,3] 24 85.71%
6 21 [3,1,1,4,2,5,4,2,0] 19 86.36% [5,7,2,3,5,1,2,4,1] 21 95.45%
\