作者: Min Kong , Peng Tian
DOI: 10.1007/11785231_119
关键词: Cutting stock problem 、 Particle swarm optimization 、 Mathematical optimization 、 Multi-swarm optimization 、 Continuous knapsack problem 、 Penalty method 、 Algorithm 、 Heuristic (computer science) 、 Mathematics 、 Swarm intelligence 、 Knapsack problem
摘要: This paper proposes a new heuristic approach based on the Particle Swarm Optimization (PSO) for Multidimensional Knapsack Problem (MKP). Instead of penalty function technique usually used to deal with constrained problem, repair operator utilizing problem-specific knowledge is incorporated into modified algorithm. Computational results show that PSO algorithm capable quickly obtaining high-quality solutions problems various characteristics.