期刊
SOFT COMPUTING
卷 22, 期 8, 页码 2567-2582出版社
SPRINGER
DOI: 10.1007/s00500-017-2511-0
关键词
Binary particle swarm optimization; Combinatory optimization; Multidimensional knapsack problem; Genetic operations
资金
- Spanish Research Agency [TRA2013-48314-C3-2-R, S2013/MIT-27139]
Particle swarm optimization is a heuristic and stochastic technique inspired by the flock of birds when looking for food. It is currently being used to solve continuous and discrete optimization problems. This paper proposes a hybrid, genetic inspired algorithm that uses random mutation/crossover operations and adds penalty functions to solve a particular case: the multidimensional knapsack problem. The algorithm implementation uses particle swarm for binary variables with a genetic operator. The particles update is performed in the following way: first using the iterative process (standard algorithm) described in the PSO algorithm and then using the best particle position (local) and the best global position to perform a random crossover/mutation with the original particle. The mutation and crossover operations specifically apply to personal and global best individuals. The obtained results are promising compared to those obtained by using the probability binary particle swarm optimization algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据