Apply the particle swarm optimization to the multidimensional knapsack problem

Authors:
Min Kong;Peng Tian
Affiliations:
Shanghai Jiaotong University, Shanghai, China;Shanghai Jiaotong University, Shanghai, China
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 4
Cited 8

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Swarm intelligence

Swarm intelligence
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

DEM: a discrete electromagnetism-like mechanism for solving discrete problems

CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
A novel set-based particle swarm optimization method for discrete optimization problems

IEEE Transactions on Evolutionary Computation
A novel quantum inspired cuckoo search for knapsack problems

International Journal of Bio-Inspired Computation
A novel artificial bee colony algorithm based on attraction pheromone for the multidimensional knapsack problems

AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

International Journal of Bio-Inspired Computation
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems

Journal of Computational and Applied Mathematics
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems

Journal of Global Optimization
Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new heuristic approach based on the Particle Swarm Optimization (PSO) for the Multidimensional Knapsack Problem (MKP). Instead of the penalty function technique usually used to deal with the constrained problem, a heuristic repair operator utilizing problem-specific knowledge is incorporated into the modified algorithm. Computational results show that the new PSO based algorithm is capable of quickly obtaining high-quality solutions for problems of various characteristics.