背包问题的基因学习优化算法

Gene Learning Optimization Algorithm for Knapsack Problem

背包问题是典型的NP完全问题,针对背包问题,给出一种新的基于基因学习思想的求解算法。基因学习算法是在PBIL算法与自私基因算法基础上提出的一种适应性和搜索能力更强的优化算法。试验取得较好的效果,表明该算法加快收敛速度和提高全局寻优能力。

Knapsack problem is NP-complete. A new type of gene learning algorithm-based is proposed to solve the 0-1 knapsack problem. Gene learning algorithm is developed from PBIL and Selfish algorithm. Experimental results show that the method has high convergence speed, good global search ability.