“…But from the analysis in section IV-C, we can know that the search complexity of the ABC-PTS with K = 40 is only SK/W (M−1) = 1200/32768 = 3.66% of that by the OPTS. For the same or almost same search complexity, the OPTS TS−− [17] MDGA,P=30, [22], [23] ABC−PTS,S=30 ABC−PTS,S=40 PSO−PTS,S=30, [20], [21] RS−900, [15] RS−1200, [15] GD−− [16] performance of the ABC-PTS with K = 40 is also better than that of RS and GD. Table. I shows comparison of computational complexity among different methods for M = 16 subblocks, where the size of population for PSO-PTS [20], [21], MDGA [22], [23] and ABC-PTS are S = P = 30, the number of maximal generations or iterations are G = K = 30.…”