Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Various Problems of Artificial Intelligence

Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem

Min KongContact Information and Peng TianContact Information

(1)  Shanghai Jiaotong University, Shanghai 200052, China
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.

Contact Information Min Kong
Email: kongmin@sjtu.edu.cn

Contact Information Peng Tian
Email: ptian@sjtu.edu.cn
Fulltext Preview (Small, Large)
Image of the first page of the fulltext


Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.81 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)