The selection of books for purchase in a library has become challenging when such a selection needs to maximize the preferences of patrons under a limited budget. The books selection problem is considered as a generalized version of the knapsack problem, which was known to be NP-hard, and thus finding the exact solution is computationally intractable for this problem. This paper presents a discrete particle swarm optimization algorithm with dynamic diversity for finding the near optimal solution with reasonable time. The experimental results manifest that the proposed method worked well for various cases.
['Tsu-Feng Ho', 'Yi-Ling Wu', 'Shyong Jian Shyu', 'Bertrand M. T. Lin']
Applying DPSO with dynamic diversity to books selection problem