Fig. 2

Comparison of results between greedy, dynamic programming, and bat algorithm—line chart. In Fig. 2, the vertical axis represents the ratio of idle network occpied by request and the horizontal axis represents multiple sets of data. The maximum time of request that can be placed in an idle network sequence, the mapping sequence based on greedy algorithm, dynamic programming and discrete bat algorithm, and the ratio of idle network occpied by request are listed in Tables 2 and 3. From the figure, we can infer that the bat algorithm is modified by binary code and sigmoid function which makes it suitable for discrete simplified model. Compared with the other two algorithms, the algorithm has achieved good results