Abstract: According to the characteristics of firefly algorithm, a weighted greedy firefly algorithm is proposed by combining adaptive weight, improved greedy algorithm, mutation operator with basic firefly algorithm. By adding adaptive weight and mutation operator, the global searching ability of the algorithm could be improved. The addition of greedy algorithm can improve the convergence speed of the algorithm to a certain extent. On the whole, the improved firefly algorithm improves the algorithm performance. Through the simulation experiment, the improved algorithm was compared with some basic algorithms. The experimental results show that the algorithm has obvious improvement in the speed and precision of solving 0-1 knapsack problem.

Key words: firefly algorithm, knapsack problem, greedy algorithm, mutation operator, adaptive weight