The performance comparison of the proposed algorithm and 17 existing algorithms in the literature.

<p>Performance comparison of the proposed algorithm and 17 existing algorithms using four existing evaluation indices. The performance comparison results using (a) index 1, (b) index 2, (c) index 3 and (d) index 4 are shown, where Rj means that the algorithm is ranked j among the 18 compared algorithms. For example, the proposed algorithm ranks first (R1) using the evaluation index 4 since the proposed algorithm has the largest score calculated using index 4. (e) The average rank is used to give the overall performance of an algorithm under four different evaluation indices. The average rank of an algorithm is the average of the ranks of an algorithm under four evaluation indices. For example, the average rank of the proposed algorithm is 1.5 = (2+2+1+1)/4 and the average rank of WangY’s algorithm is 4 = (1+4+6+5)/4. The smaller the average rank is, the better the performance of an algorithm is. Since the proposed algorithm has the smallest average rank, the overall performance of the proposed algorithm is the best among all the 18 compared algorithms.