Computer and Modernization ›› 2014, Vol. 0 ›› Issue (4): 113-117.

Previous Articles     Next Articles

Firefly Algorithm for Solving 01 Knapsack Problem

  

  1. School of Computer, Communication University of China, Beijing 100024, China
  • Received:2014-02-07 Online:2014-04-17 Published:2014-04-23

Abstract:  

Abstract:  Taking advantage of the standard firefly algorithm (FA) and combining with the characteristics of the 01 knapsack problem, this paper designs a firefly algorithm based on 01 knapsack problem. After experimental simulation, we verified the firefly algorithm’s feasibility and effectiveness to solve 01 knapsack problem. Finally, after many simulation experiments, this paper analyzes the influence of various parameters on the algorithm performance, reflected the importance of selection of key parameters to the algorithm optimization.

Key words:

CLC Number: