Modification of Attractiveness and Movement of the Firefly Algorithm for Resolution to Knapsack Problems

Knapsack problems pertain to selections of a number of items stored in order to obtain optimal storage. A container can accommodate these items with weight and values through the consideration of the capacity of the storage media. In this research, strategy on attractiveness and movement of the firefly algorithm was proposed to solve knapsack problems. This algorithm was tested through the comparison of the others, namely the original firefly algorithm, the firefly algorithm with attractiveness modification, the firefly algorithm with movement modification, and the firefly algorithm with a modified combination of attractiveness and movement. Applying each of them, there are differences of time and results of completion. Compared to the original firefly algorithm, the one with a modified combination of attractiveness and movement has the best convergence behavior and global optimization efficiency. It is found that the more iterations and the number of fireflies are, the longer the processing time will be. Despite this, the original firefly algorithm requires short time.