Particle Swarm Optimization for the Multidimensional Knapsack Problem

Authors:
Fernanda Hembecker;Heitor S. Lopes;Walter Godoy, Jr.
Affiliations:
Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil;Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil;Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 8
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
The zero/one multiple knapsack problem and genetic algorithms

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Swarm intelligence

Swarm intelligence
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Comparison between Genetic Algorithms and Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
The particle swarm optimization algorithm: convergence analysis and parameter selection

Information Processing Letters
Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
Self-adapting evolutionary parameters: encoding aspects for combinatorial optimization problems

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization

Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Particle Swarm Optimization for Object Recognition in Computer Vision

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Parallelism, hybridism and coevolution in a multi-level ABC-GA approach for the protein structure prediction problem

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multidimensional 0/1 knapsack problem is a classical problem of discrete optimization. There are several approaches for solving the different variations of such problem, including mathematical programming and stochastic heuristic methods. This paper presents the application of Particle Swarm Optimization (PSO) for the problem, using selected instances of ORLib. For the instances tested, results were very close or equal to the optimal solution known, even considering that the parameters of PSO were not optimized. The analysis of the results suggests the potential of a simple PSO for this class of combinatorial problems.