摘要:
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.
展开