摘要：

For solving the optimization problem in discrete space, a Binary Bat Algorithm(BBA) is proposed, and time-varying inertia factor is introduced to improve the global convergence speed of the algorithm. In order to increase the probability of finding the optimal solution in solving 0-1 knapsack problem, greedy strategy is used in the algorithm, thus a Greedy Binary Bat Algorithm(GBBA) is proposed. Simulations show that the proposed algorithm is much superior to GMBA algorithm in searching capability and convergence performance.

展開

總結

以上是生活随笔為你收集整理的蝙蝠算法c语言,求解0-1背包问题的二进制蝙蝠算法的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。