求解0-1背包问题的混沌遗传算法  

Novel chaos genetic algorithm for solving 0-1 knapsack problem

作　　者：田建立[1] 晁学鹏[1] 

机构地区：[1]黄河科技学院计算机科学系,郑州450006

出　　处：《计算机应用研究》2011年第8期2838-2839,2879,共3页Application Research of Computers

摘　　要：提出一种改进的混沌遗传算法来求解0-1背包问题。通过利用幂函数载波技术增强混沌搜索的遍历性,把混沌搜索得到的最优解直接作为新群体嵌入遗传算法来改善遗传算法的早熟问题,从而使算法有能力避免陷入局部极值而快速收敛于全局最优解。仿真实验结果表明了该算法求解0-1背包问题的有效性和适用性。This paper proposed a novel chaos genetic algorithm for solving the 0-1 knapsack problem.Enhanced the ergodicity of chaotic search by using power function carrier technology,improved genetic algorithm premature problem by embeding chaos optimal solution obtained into basic GA,and improved the capacity of algorithm to avoid the local extreme and to converge to the global optimal solution quickly.Results of the numerical experiment show that the proposed algorithm is effective and useful in solving 0-1 knapsack problem.

关 键 词：混沌遗传算法 幂函数载波技术 背包问题 优化算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]