Solving multidimensional 0---1 knapsack problem with an artificial fish swarm algorithm
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Comparing particle swarm optimization variants for a cognitive radio network
Applied Soft Computing
| Hi-index | 0.00 |
The Multidimensional knapsack problem (MKP), which is a generalization of the 0-1 simple Knapsack problem, is one of the classical NP-hard problems in operations research having a number of engineering applications. Several exact as well as heuristic algorithms are available in literature for its solution. In this paper, we propose a new Particle Swarm Optimization (PSO) algorithm namely Socio-Cognitive Particle Swarm Optimization (SCPSO) for solving the MKP. Comparing with the basic Binary Particle Swarm Optimization (BPSO), this improved algorithm introduces the distance between gbest and pbest as a new velocity update equation which maintains the diversity in the swarm and makes it more effective and efficient in solving MKP. We present computational experiments with various data instances for fine tuning of parameters of SCPSO and to validate our ideas and demonstrate the efficiency of the proposed algorithm